Sciweavers

3422 search results - page 600 / 685
» Random Subset Optimization
Sort
View
130
Voted
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 8 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
136
Voted
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 8 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
APGV
2004
ACM
102views Visualization» more  APGV 2004»
15 years 8 months ago
Second order image statistics in computer graphics
The class of all natural images is an extremely small fraction of all possible images. Some of the structure of natural images can be modeled statistically, revealing striking reg...
Erik Reinhard, Peter Shirley, Michael Ashikhmin, T...
CIKM
2004
Springer
15 years 8 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 8 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang