2489 search results - page 289 / 498 » On the Subgroup Distance Problem |
154
click to vote
JMLR
2012
13 years 6 months ago
2012
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
142
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
146
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
127
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
172
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We study the cosegmentation problem where the objective
is to segment the same object (i.e., region) from a pair
of images. The segmentation for each image can be cast
using a p...