Sciweavers

SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 1 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
SODA
2010
ACM
152views Algorithms» more  SODA 2010»
14 years 1 months ago
The focus of attention problem
Dries Goossens, Sergey Polyakovskiy, Frits Spieksm...
SODA
2010
ACM
232views Algorithms» more  SODA 2010»
14 years 1 months ago
On the Optimality of Spiral Search
Searching for a point in the plane is a well-known search game problem introduced in the early eigthies. The best known search strategy is given by a spiral and achieves a competi...
Elmar Langetepe
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 1 months ago
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
Subhash Khot, Assaf Naor
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 1 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
SODA
2010
ACM
409views Algorithms» more  SODA 2010»
14 years 1 months ago
Data Structures for Range Minimum Queries in Multidimensional Arrays
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
Hao Yuan, Mikhail J. Atallah
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
14 years 1 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
14 years 1 months ago
VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension
Elchanan Mossel, Christos Papadimitriou, Michael S...
SODA
2010
ACM
290views Algorithms» more  SODA 2010»
14 years 1 months ago
Rumour spreading and graph conductance
Flavio Chierichetti, Silvio Lattanzi, Alessandro P...