3894 search results - page 318 / 779 » Approximation Algorithms for Biclustering Problems |
120
Voted
SIAMDM
2010
15 years 1 months ago
2010
Let A be a 0/1 matrix of size m
192
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
170
Voted
WEA
2005
Springer
16 years 5 days ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
212
click to vote
IJCV
2012
13 years 9 months ago
2012
Abstract We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reflection and static illumination, the task can be posed as a vari...
205
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...