7930 search results - page 1349 / 1586 » Greedy in Approximation Algorithms |
167
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
190
click to vote
MMAS
2011
Springer
14 years 11 months ago
2011
Springer
While existing mathematical descriptions can accurately account for phenomena at microscopic scales (e.g. molecular dynamics), these are often high-dimensional, stochastic and thei...
202
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
197
Voted
JMLR
2012
13 years 7 months ago
2012
We present a unifying framework for information theoretic feature selection, bringing almost two decades of research on heuristic filter criteria under a single theoretical inter...
225
Voted
CVPR
2009
IEEE
17 years 5 days ago
2009
IEEE
Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation beca...