Eran Ofek

Publication Activity (10 Years)

Years Active: 2002-2023
Publications (10 Years): 3

Top Topics

Medical Imaging

Active Appearance Models

Image Alignment

Top Venues

Publications

Michal Yarom, Yonatan Bitton, Soravit Changpinyo, Roee Aharoni, Jonathan Herzig, Oran Lang, Eran Ofek, Idan Szpektor
What You See is What You Read? Improving Text-Image Alignment Evaluation. CoRR (2023)
Michal Yarom, Yonatan Bitton, Soravit Changpinyo, Roee Aharoni, Jonathan Herzig, Oran Lang, Eran Ofek, Idan Szpektor
What You See is What You Read? Improving Text-Image Alignment Evaluation. NeurIPS (2023)
Idan Szpektor, Deborah Cohen, Gal Elidan, Michael Fink, Avinatan Hassidim, Orgad Keller, Sayali Kulkarni, Eran Ofek, Sagie Pudinsky, Asaf Revach, Shimi Salant, Yossi Matias
Dynamic Composition for Conversational Domain Exploration. WWW (2020)
Itai Benjamini, Carlos Hoppen, Eran Ofek, Pawel Pralat, Nicholas C. Wormald
Geodesics and almost geodesic cycles in random regular graphs. J. Graph Theory 66 (2) (2011)
Uriel Feige, Eran Ofek
Finding a Maximum Independent Set in a Sparse Random Graph. SIAM J. Discret. Math. 22 (2) (2008)
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
Routing complexity of faulty networks. Random Struct. Algorithms 32 (1) (2008)
Eran Ofek
On the Expansion of the Giant Component in Percolated (n, d, lambda) Graphs. Comb. Probab. Comput. 16 (3) (2007)
Uriel Feige, Eran Ofek
Easily refutable subformulas of large random 3CNF formulas. Theory Comput. 3 (1) (2007)
Eran Ofek, Uriel Feige
Random 3CNF formulas elude the Lovasz theta function. Electron. Colloquium Comput. Complex. 13 (043) (2006)
Uriel Feige, Jeong Han Kim, Eran Ofek
Witnesses for non-satisfiability of dense random 3CNF formulas. FOCS (2006)
Uriel Feige, Eran Ofek
Random 3CNF formulas elude the Lovasz theta function CoRR (2006)
Uriel Feige, Eran Ofek
Spectral techniques applied to sparse random graphs. Random Struct. Algorithms 27 (2) (2005)
Uriel Feige, Eran Ofek
Finding a Maximum Independent Set in a Sparse Random Graph. APPROX-RANDOM (2005)
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
Routing complexity of faulty networks. PODC (2005)
Eran Ofek
On the expansion of the giant component in percolated (n,d,lambda) graphs Electron. Colloquium Comput. Complex. (112) (2005)
Uriel Feige, Eran Ofek
Finding a Maximum Independent Set in a Sparse Random Graph Electron. Colloquium Comput. Complex. (050) (2005)
Uriel Feige, Eran Ofek
Easily Refutable Subformulas of Large Random 3CNF Formulas. ICALP (2004)
Uriel Feige, Eran Ofek, Udi Wieder
Approximating Maximum Edge Coloring in Multigraphs. APPROX (2002)