4 citations · 4 across the 5 of their papers we have counts for
5 papers
Weighted Distance Nearest Neighbor Condensing
Lee-Ad Gottlieb, Timor Sharabi, Roi Weiss
The problem of nearest neighbor condensing has enjoyed a long history of study, both in its theoretical and practical aspects. In this paper, we introduce the problem of weighted d…
Using Deepfake Technologies for Word Emphasis Detection
Eran Kaufman, Lee-Ad Gottlieb
In this work, we consider the task of automated emphasis detection for spoken language. This problem is challenging in that emphasis is affected by the particularities of speech of…
Optimizing Budget Allocation in Graphs
Boaz Ben-Moshe, Michael Elkin, Lee-Ad Gottlieb +1
In the classical facility location problem we consider a graph with fixed weights on the edges of . The goal is then to find an optimal positioning for a set of facilities o…
Fast, precise and dynamic distance queries
Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz +2
We present an approximate distance oracle for a point set S with n points and doubling dimension λ. For every ε>0, the oracle supports (1+ε)-approximate distance queries in (univer…
VC bounds on the cardinality of nearly orthogonal function classes
Lee-Ad Gottlieb, Leonid, Kontorovich +1
We bound the number of nearly orthogonal vectors with fixed VC-dimension over $\setpm^n$. Our bounds are of interest in machine learning and empirical process theory and improve pr…