Sciweavers

2638 search results - page 3 / 528
» Random Geometric Complexes
Sort
View
ICDIM
2007
IEEE
14 years 1 months ago
An access control video watermarking method that is robust to geometric distortions
: A new video watermarking algorithm for access control is introduced. This method is content-dependent and uses the dual tree complex wavelet transform (DT CWT) to create a waterm...
Lino Coria-Mendoza, Panos Nasiopoulos, Rabab Kreid...
FOCS
2008
IEEE
14 years 1 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
COMPGEOM
2009
ACM
14 years 1 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
SPAA
2005
ACM
14 years 18 days ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 7 months ago
Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...