64 search results - page 3 / 13 » To randomize or not to randomize: space optimal summaries fo... |
ICALP
2003
Springer
14 years 19 days ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
DRR
2010
13 years 9 months ago
2010
Scaling up document-image classifiers to handle an unlimited variety of document and image types poses serious challenges to conventional trainable classifier technologies. Highly...
GECCO
2004
Springer
14 years 25 days ago
2004
Springer
Portable embedded systems are being driven by consumer demands to be thermally efficient, perform faster, and have longer battery life. To design such a system, various hardware un...