1272 search results - page 171 / 255 » Approximate Parameterized Matching |
110
click to vote
DMSN
2004
ACM
15 years 9 months ago
2004
ACM
Recent years have witnessed an increasing interest in filtering of distributed data streams, such as those produced by networked sensors. The focus is to conserve bandwidth and se...
124
Voted
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Although the recent advances in the sparse representations of images have achieved outstanding denosing results, removing real, structured noise in digital videos remains a challen...
154
click to vote
ALGORITHMICA
2006
15 years 3 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
139
Voted
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
134
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...