2489 search results - page 249 / 498 » On the Subgroup Distance Problem |
191
Voted
SWAT
2010
Springer
15 years 3 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
141
Voted
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
187
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
The design of feature spaces for local image descriptors is an important research subject in computer vision due to its applicability in several problems, such as visual classifi...
135
Voted
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
160
Voted
STOC
2007
ACM
16 years 5 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...