default search action
Lee-Ad Gottlieb
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Arnold Filtser
, Lee-Ad Gottlieb, Robert Krauthgamer:
Labelings vs. Embeddings: On Distributed and Prioritized Representations of Distances. Discret. Comput. Geom. 71(3): 849-871 (2024) - [j24]Yair Ashlagi, Lee-Ad Gottlieb, Aryeh Kontorovich:
Functions with average smoothness: structure, algorithms, and learning. J. Mach. Learn. Res. 25: 117:1-117:54 (2024) - [j23]Lee-Ad Gottlieb
Nested barycentric coordinate system as an explicit feature map for polyhedra approximation and learning tasks. Mach. Learn. 113(10): 7807-7840 (2024) - [c28]Lee-Ad Gottlieb, Timor Sharabi, Roi Weiss:
Weighted distance nearest neighbor condensing. ICML 2024 - 2023
- [j22]Saed Asaly
Predicting Eastern Mediterranean Flash Floods Using Support Vector Machines with Precipitable Water Vapor, Pressure, and Lightning Data. Remote. Sens. 15(11): 2916 (2023) - [c27]Eran Kaufman, Lee-Ad Gottlieb, Dina Mayzlish, Or Tiram, Hila Wiesel, Nofar Yosef:
Using Deepfake Technologies for Word Emphasis Detection. PACLIC 2023: 717-722 - [i25]Eran Kaufman, Lee-Ad Gottlieb:
Using Deepfake Technologies for Word Emphasis Detection. CoRR abs/2305.07791 (2023) - [i24]Lee-Ad Gottlieb, Timor Sharabi, Roi Weiss:
Weighted Distance Nearest Neighbor Condensing. CoRR abs/2310.15951 (2023) - 2022
- [j21]Lee-Ad Gottlieb, Aryeh Kontorovich:
Non-uniform packings. Inf. Process. Lett. 174: 106179 (2022) - [j20]Saed Asaly
Using Support Vector Machine (SVM) with GPS Ionospheric TEC Estimations to Potentially Predict Earthquake Events. Remote. Sens. 14(12): 2822 (2022) - [j19]Lee-Ad Gottlieb, Robert Krauthgamer, Havana Rika
Faster algorithms for orienteering and k-TSP. Theor. Comput. Sci. 914: 73-83 (2022) - [j18]Lee-Ad Gottlieb
Learning Convex Polyhedra With Margin. IEEE Trans. Inf. Theory 68(3): 1976-1984 (2022) - [c26]Benjamin Azaria, Lee-Ad Gottlieb:
Predicting Subscriber Usage: Analyzing Multidimensional Time-Series Using Convolutional Neural Networks. CSCML 2022: 259-269 - 2021
- [j17]Lee-Ad Gottlieb
Apportioned margin approach for cost sensitive large margin classifiers. Ann. Math. Artif. Intell. 89(12): 1215-1235 (2021) - [j16]Saed Asaly
Using Support Vector Machine (SVM) and Ionospheric Total Electron Content (TEC) Data for Solar Flare Predictions. IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. 14: 1469-1481 (2021) - [c25]Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich, Gabriel Nivasch, Ofir Pele:
Nested Barycentric Coordinate System as an Explicit Feature Map. AISTATS 2021: 766-774 - [c24]Yair Ashlagi, Lee-Ad Gottlieb, Aryeh Kontorovich:
Functions with average smoothness: structure, algorithms, and learning. COLT 2021: 186-236 - [c23]Yair Bartal, Lee-Ad Gottlieb:
Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. STOC 2021: 1028-1041 - 2020
- [c22]Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer:
Labelings vs. Embeddings: On Distributed Representations of Distances. SODA 2020: 1063-1075 - [i23]Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich:
Apportioned Margin Approach for Cost Sensitive Large Margin Classifiers. CoRR abs/2002.01408 (2020) - [i22]Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich, Gabriel Nivasch, Ofir Pele:
Nested Barycentric Coordinate System as an Explicit Feature Map. CoRR abs/2002.01999 (2020) - [i21]Lee-Ad Gottlieb, Robert Krauthgamer, Havana Rika:
Faster Algorithms for Orienteering and k-TSP. CoRR abs/2002.07727 (2020) - [i20]Yair Ashlagi, Lee-Ad Gottlieb, Aryeh Kontorovich:
Functions with average smoothness: structure, algorithms, and learning. CoRR abs/2007.06283 (2020)
2010 – 2019
- 2019
- [j15]Yair Bartal, Lee-Ad Gottlieb
Approximate nearest neighbor search for ℓp-spaces (2<p<∞). Theor. Comput. Sci. 757: 27-35 (2019) - [i19]Lee-Ad Gottlieb, Yair Bartal:
Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. CoRR abs/1904.03611 (2019) - [i18]Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer:
Labelings vs. Embeddings: On Distributed Representations of Distances. CoRR abs/1907.06857 (2019) - [i17]Lee-Ad Gottlieb, Shira Ozeri:
Classification in asymmetric spaces via sample compression. CoRR abs/1909.09969 (2019) - 2018
- [j14]Lee-Ad Gottlieb
Near-Optimal Sample Compression for Nearest Neighbors. IEEE Trans. Inf. Theory 64(6): 4120-4128 (2018) - [c21]Yair Bartal, Lee-Ad Gottlieb
Approximate Nearest Neighbor Search for \ell _p -Spaces (2 via Embeddings. LATIN 2018: 120-133 - [c20]Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich, Gabriel Nivasch:
Learning convex polytopes with margin. NeurIPS 2018: 5711-5721 - [i16]Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich, Gabriel Nivasch:
Learning convex polytopes with margin. CoRR abs/1805.09719 (2018) - 2017
- [j13]Lee-Ad Gottlieb, Aryeh Kontorovich, Pinhas Nisnevitch:
Nearly optimal classification for semimetrics. J. Mach. Learn. Res. 18: 37:1-37:22 (2017) - [j12]Lee-Ad Gottlieb
Efficient Regression in Metric Spaces via Approximate Lipschitz Extension. IEEE Trans. Inf. Theory 63(8): 4838-4849 (2017) - 2016
- [j11]Lee-Ad Gottlieb
Matrix Sparsification and the Sparse Null Space Problem. Algorithmica 76(2): 426-444 (2016) - [j10]Yair Bartal, Lee-Ad Gottlieb
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme. SIAM J. Comput. 45(4): 1563-1581 (2016) - [j9]Lee-Ad Gottlieb
Adaptive metric dimensionality reduction. Theor. Comput. Sci. 620: 105-118 (2016) - [j8]Boaz Ben-Moshe, Michael Elkin, Lee-Ad Gottlieb
Optimizing budget allocation for center and median points. Theor. Comput. Sci. 627: 13-25 (2016) - [c19]Lee-Ad Gottlieb, Aryeh Kontorovich, Pinhas Nisnevitch:
Nearly Optimal Classification for Semimetrics. AISTATS 2016: 379-388 - [c18]Yair Bartal, Lee-Ad Gottlieb
Dimension Reduction Techniques for ℓp (1<p<2), with Applications. SoCG 2016: 16:1-16:15 - 2015
- [j7]Lee-Ad Gottlieb
A Nonlinear Approach to Dimension Reduction. Discret. Comput. Geom. 54(2): 291-315 (2015) - [j6]Yair Bartal, Lee-Ad Gottlieb
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. SIAM J. Discret. Math. 29(3): 1207-1222 (2015) - [c17]Lee-Ad Gottlieb
A Light Metric Spanner. FOCS 2015: 759-772 - [i15]Lee-Ad Gottlieb, Aryeh Kontorovich:
Nearly optimal classification for semimetrics. CoRR abs/1502.06208 (2015) - [i14]Lee-Ad Gottlieb:
A light metric spanner. CoRR abs/1505.03681 (2015) - [i13]Yair Bartal, Lee-Ad Gottlieb:
Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings. CoRR abs/1512.01775 (2015) - 2014
- [j5]Lee-Ad Gottlieb
Efficient Classification for Metric Data. IEEE Trans. Inf. Theory 60(9): 5750-5759 (2014) - [c16]Yair Bartal, Lee-Ad Gottlieb
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. SoCG 2014: 60 - [c15]Lee-Ad Gottlieb
Light spanners for Snowflake Metrics. SoCG 2014: 387 - [c14]Lee-Ad Gottlieb, Aryeh Kontorovich, Pinhas Nisnevitch:
Near-optimal sample compression for nearest neighbors. NIPS 2014: 370-378 - [i12]Lee-Ad Gottlieb, Shay Solomon:
Light spanners for snowflake metrics. CoRR abs/1401.5014 (2014) - [i11]Lee-Ad Gottlieb, Aryeh Kontorovich:
Near-optimal sample compression for nearest neighbors. CoRR abs/1404.3368 (2014) - [i10]Boaz Ben-Moshe, Michael Elkin, Lee-Ad Gottlieb, Eran Omri:
Optimizing Budget Allocation in Graphs. CoRR abs/1406.2107 (2014) - [i9]Yair Bartal, Lee-Ad Gottlieb:
Dimension reduction techniques for ℓp, 1 ≤ p < ∞, with applications. CoRR abs/1408.1789 (2014) - 2013
- [j4]Lee-Ad Gottlieb
Proximity Algorithms for Nearly Doubling Spaces. SIAM J. Discret. Math. 27(4): 1759-1769 (2013) - [c13]Lee-Ad Gottlieb
Adaptive Metric Dimensionality Reduction. ALT 2013: 279-293 - [c12]Yair Bartal, Lee-Ad Gottlieb
A Linear Time Approximation Scheme for Euclidean TSP. FOCS 2013: 698-706 - [c11]Lee-Ad Gottlieb
Efficient Regression in Metric Spaces via Approximate Lipschitz Extension. SIMBAD 2013: 43-58 - [i8]Lee-Ad Gottlieb, Aryeh Kontorovich, Robert Krauthgamer:
Adaptive Metric Dimensionality Reduction. CoRR abs/1302.2752 (2013) - [i7]Lee-Ad Gottlieb, Aryeh Kontorovich, Robert Krauthgamer:
Efficient Classification for Metric Data. CoRR abs/1306.2547 (2013) - [i6]Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman:
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp, p>2. CoRR abs/1308.4996 (2013) - 2012
- [j3]Lee-Ad Gottlieb
VC bounds on the cardinality of nearly orthogonal function classes. Discret. Math. 312(10): 1766-1775 (2012) - [c10]Yair Bartal, Lee-Ad Gottlieb
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme. STOC 2012: 663-672 - 2011
- [c9]Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty:
Fast, precise and dynamic distance queries. SODA 2011: 840-853 - [c8]Lee-Ad Gottlieb, Robert Krauthgamer:
A Nonlinear Approach to Dimension Reduction. SODA 2011: 888-899 - [i5]Lee-Ad Gottlieb, Aryeh Kontorovich, Robert Krauthgamer:
Efficient Regression in Metric Spaces via Approximate Lipschitz Extension. CoRR abs/1111.4470 (2011) - [i4]Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer:
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme. CoRR abs/1112.0699 (2011) - 2010
- [c7]Lee-Ad Gottlieb
Proximity Algorithms for Nearly-Doubling Spaces. APPROX-RANDOM 2010: 192-204 - [c6]Lee-Ad Gottlieb
Matrix Sparsification and the Sparse Null Space Problem. APPROX-RANDOM 2010: 205-218 - [c5]Lee-Ad Gottlieb, Leonid Kontorovich, Robert Krauthgamer:
Efficient Classification for Metric Data. COLT 2010: 433-440 - [i3]Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty:
Fast, precise and dynamic distance queries. CoRR abs/1008.1480 (2010) - [i2]Lee-Ad Gottlieb, Tyler Neylon:
Matrix sparsification and the sparse null space problem. CoRR abs/1008.1498 (2010)
2000 – 2009
- 2009
- [b1]Lee-Ad Gottlieb:
Proximity problems for point sets residing in spaces with low doubling dimension. New York University, USA, 2009 - [i1]Lee-Ad Gottlieb, Robert Krauthgamer:
A Nonlinear Approach to Dimension Reduction. CoRR abs/0907.5477 (2009) - 2008
- [c4]Lee-Ad Gottlieb, Liam Roditty:
An Optimal Dynamic Spanner for Doubling Metric Spaces. ESA 2008: 478-489 - [c3]Lee-Ad Gottlieb, Liam Roditty:
Improved algorithms for fully dynamic geometric spanners and geometric routing. SODA 2008: 591-600 - 2006
- [c2]Richard Cole, Lee-Ad Gottlieb:
Searching dynamic point sets in spaces with bounded doubling dimension. STOC 2006: 574-583 - 2005
- [j2]Lee-Ad Gottlieb
Efficient Data Storage in Large Nanoarrays. Theory Comput. Syst. 38(4): 503-536 (2005) - 2004
- [c1]Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein:
Dictionary matching and indexing with errors and don't cares. STOC 2004: 91-100 - 2003
- [j1]Sigal Gottlieb, Lee-Ad Gottlieb
Strong Stability Preserving Properties of Runge-Kutta Time Discretization Methods for Linear Constant Coefficient Operators. J. Sci. Comput. 18(1): 83-109 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: