9572 search results - page 1688 / 1915 » Cover Algorithms and Their Combination |
159
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
159
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
179
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small...
252
click to vote
FCCM
2011
IEEE
14 years 8 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
170
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Spatially-discrete Markov random fields (MRFs) and spatially-continuous variational approaches are ubiquitous in low-level vision, including image restoration, segmentation, opti...