2489 search results - page 378 / 498 » On the Subgroup Distance Problem |
143
Voted
CN
2002
15 years 3 months ago
2002
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
193
Voted
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
131
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
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...
177
Voted
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
In this paper, we consider the problem of categorizing
videos of dynamic textures under varying view-point. We
propose to model each video with a collection of Linear
Dynamics S...
167
Voted
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We present a closed-form solution to the problem of recovering
the 3D shape of a non-rigid potentially stretchable
surface from 3D-to-2D correspondences. In other words,
we can ...