6393 search results - page 846 / 1279 » Randomized Algorithms on the Mesh |
294
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
217
click to vote
INFOCOM
2009
IEEE
16 years 2 months ago
2009
IEEE
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
228
click to vote
CIVR
2009
Springer
16 years 2 months ago
2009
Springer
We start from the state-of-the-art Bag of Words pipeline that in the 2008 benchmarks of TRECvid and PASCAL yielded the best performance scores. We have contributed to that pipelin...
197
click to vote
COCO
2009
Springer
16 years 2 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
251
Voted
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....