Lee-Ad Gottlieb

Discret. Comput. Geom., April, 2024

Functions with average smoothness: structure, algorithms, and learning.

[BibT_eX]

[DOI]

Yair Ashlagi

J. Mach. Learn. Res., 2024

Weighted distance nearest neighbor condensing.

[BibT_eX]

[DOI]

Timor Sharabi

Roi Weiss

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Novel Properties of Hierarchical Probabilistic Partitions and Their Algorithmic Applications.

[BibT_eX]

[DOI]

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Predicting Eastern Mediterranean Flash Floods Using Support Vector Machines with Precipitable Water Vapor, Pressure, and Lightning Data.

[BibT_eX]

[DOI]

Remote. Sens., 2023

Using Deepfake Technologies for Word Emphasis Detection.

[BibT_eX]

[DOI]

Eran Kaufman

CoRR, 2023

Using Deepfake Technologies for Word Emphasis Detection.

[BibT_eX]

[DOI]

Proceedings of the 37th Pacific Asia Conference on Language, 2023

2022

Learning Convex Polyhedra With Margin.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Faster algorithms for orienteering and k-TSP.

[BibT_eX]

[DOI]

Havana Rika

Theor. Comput. Sci., 2022

Using Support Vector Machine (SVM) with GPS Ionospheric TEC Estimations to Potentially Predict Earthquake Events.

[BibT_eX]

[DOI]

Remote. Sens., 2022

Non-uniform packings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

Predicting Subscriber Usage: Analyzing Multidimensional Time-Series Using Convolutional Neural Networks.

[BibT_eX]

[DOI]

Benjamin Azaria

Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

2021

Using Support Vector Machine (SVM) and Ionospheric Total Electron Content (TEC) Data for Solar Flare Predictions.

[BibT_eX]

[DOI]

Saed Asaly

Yuval Reuveni

IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens., 2021

Apportioned margin approach for cost sensitive large margin classifiers.

[BibT_eX]

[DOI]

Eran Kaufman

Ann. Math. Artif. Intell., 2021

Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Nested Barycentric Coordinate System as an Explicit Feature Map.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

Faster Algorithms for Orienteering and k-TSP.

[BibT_eX]

[DOI]

Havana Rika

CoRR, 2020

Labelings vs. Embeddings: On Distributed Representations of Distances.

[BibT_eX]

[DOI]

Arnold Filtser

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Approximate nearest neighbor search for ℓp-spaces (2<p<∞).

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Classification in asymmetric spaces via sample compression.

[BibT_eX]

[DOI]

Shira Ozeri

CoRR, 2019

2018

Near-Optimal Sample Compression for Nearest Neighbors.

[BibT_eX]

[DOI]

Pinhas Nisnevitch

IEEE Trans. Inf. Theory, 2018

Learning convex polytopes with margin.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Approximate Nearest Neighbor Search for \ell _p -Spaces (2 via Embeddings.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Efficient Regression in Metric Spaces via Approximate Lipschitz Extension.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Nearly optimal classification for semimetrics.

[BibT_eX]

[DOI]

Pinhas Nisnevitch

J. Mach. Learn. Res., 2017

2016

Adaptive metric dimensionality reduction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Optimizing budget allocation for center and median points.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Matrix Sparsification and the Sparse Null Space Problem.

[BibT_eX]

[DOI]

Tyler Neylon

Algorithmica, 2016

Dimension Reduction Techniques for ℓp (1<p<2), with Applications.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp.

[BibT_eX]

[DOI]

Ofer Neiman

SIAM J. Discret. Math., 2015

A Nonlinear Approach to Dimension Reduction.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Nearly optimal classification for semimetrics.

[BibT_eX]

[DOI]

CoRR, 2015

Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings.

[BibT_eX]

[DOI]

CoRR, 2015

A Light Metric Spanner.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Efficient Classification for Metric Data.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Near-optimal sample compression for nearest neighbors.

[BibT_eX]

[DOI]

CoRR, 2014

Optimizing Budget Allocation in Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Dimension reduction techniques for ℓp, 1 ≤ p < ∞, with applications.

[BibT_eX]

[DOI]

CoRR, 2014

Light spanners for Snowflake Metrics.

[BibT_eX]

[DOI]

Shay Solomon

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp.

[BibT_eX]

[DOI]

Ofer Neiman

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Proximity Algorithms for Nearly Doubling Spaces.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp, p>2.

[BibT_eX]

[DOI]

Ofer Neiman

CoRR, 2013

A Linear Time Approximation Scheme for Euclidean TSP.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

VC bounds on the cardinality of nearly orthogonal function classes.

[BibT_eX]

[DOI]

Elchanan Mossel

Discret. Math., 2012

2011

Fast, precise and dynamic distance queries.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2009

Proximity problems for point sets residing in spaces with low doubling dimension.

[BibT_eX]

[DOI]

PhD thesis, 2009

2008

Improved algorithms for fully dynamic geometric spanners and geometric routing.

[BibT_eX]

[DOI]

Liam Roditty

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

An Optimal Dynamic Spanner for Doubling Metric Spaces.

[BibT_eX]

[DOI]

Liam Roditty

Proceedings of the Algorithms, 2008

2006

Searching dynamic point sets in spaces with bounded doubling dimension.

[BibT_eX]

[DOI]

Richard Cole

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005

Efficient Data Storage in Large Nanoarrays.

[BibT_eX]

[DOI]

John E. Savage

Arkady Yerukhimovich

Theory Comput. Syst., 2005

2004

Dictionary matching and indexing with errors and don't cares.

[BibT_eX]

[DOI]

Richard Cole

Moshe Lewenstein

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2003

Strong Stability Preserving Properties of Runge-Kutta Time Discretization Methods for Linear Constant Coefficient Operators.

[BibT_eX]

[DOI]

Sigal Gottlieb