545 search results - page 44 / 109 » Simultaneous approximation by greedy algorithms |
130
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
Inherent to photograph-like images are two types of structures: large smooth regions and geometrically smooth edge contours separating those regions. Over the past years, efficien...
142
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
We address the problem of finding sparse wavelet representations of high-dimensional vectors. We present a lower-bounding technique and use it to develop an algorithm for computi...
244
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
141
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
141
Voted
SIROCCO
2001
15 years 5 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...