3422 search results - page 537 / 685 » Random Subset Optimization |
123
click to vote
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
126
click to vote
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
Current methods for selectivity estimation fall into two broad categories, synopsis-based and sampling-based. Synopsis-based methods, such as histograms, incur minimal overhead at ...
125
click to vote
EUROSYS
2006
ACM
16 years 5 days ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
158
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
120
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...