7978 search results - page 540 / 1596 » Combining shared-coin algorithms |
277
click to vote
CISS
2011
IEEE
14 years 10 months ago
2011
IEEE
—We consider a multi-static radar scenario with spatially dislocated receivers that can individually extract delay information only. Furthermore, we assume that the receivers are...
225
click to vote
CORR
2011
Springer
14 years 10 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....
207
click to vote
CORR
2011
Springer
14 years 10 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...
219
click to vote
CORR
2011
Springer
14 years 10 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...
316
Voted
FCCM
2011
IEEE
14 years 10 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...