4377 search results - page 778 / 876 » Mass problems and randomness |
105
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
198
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
Estimating the selectivity of multidimensional range queries over real valued attributes has significant applications in data exploration and database query optimization. In this p...
SIGMOD
2005
ACM
15 years 10 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...
121
click to vote
MOBIHOC
2004
ACM
15 years 9 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...