2489 search results - page 378 / 498 » On the Subgroup Distance Problem |
174
click to vote
CN
2002
15 years 6 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...
231
click to vote
ICALP
2011
Springer
14 years 10 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 ...
171
click to vote
FOCS
2008
IEEE
16 years 26 days 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...
214
click to vote
CVPR
2009
IEEE
17 years 1 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...
204
click to vote
CVPR
2009
IEEE
17 years 1 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 ...