Sciweavers

55 search results - page 9 / 11
» Lattice problems and norm embeddings
Sort
View
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
14 years 7 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
CDC
2009
IEEE
159views Control Systems» more  CDC 2009»
14 years 5 days ago
Event-triggered control for multi-agent systems
— Event-driven strategies for multi-agent systems are motivated by the future use of embedded microprocessors with limited resources that will gather information and actuate the ...
Dimos V. Dimarogonas, Karl Henrik Johansson
FOCM
2011
175views more  FOCM 2011»
13 years 2 months ago
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
Donald Goldfarb, Shiqian Ma
COMPGEOM
2004
ACM
14 years 27 days ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
ICASSP
2008
IEEE
14 years 1 months ago
Generalized Improved Spread Spectrum watermarking robust against translation attacks
In this work, we consider the ISS (improved spread spectrum) watermarking [1] framework, and propose a generalized version of it, termed “Generalized Improved Spread Spectrum”...
Neslihan Gerek, Mehmet Kivanç Mihçak