22588 search results - page 4427 / 4518 » On simulation model complexity |
139
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
165
click to vote
ICALP
2009
Springer
16 years 4 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...
228
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
There is currently considerable enthusiasm around the MapReduce (MR) paradigm for large-scale data analysis [17]. Although the basic control flow of this framework has existed in ...
210
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
We introduce scalability for computer games as the next frontier for techniques from data management. A very important aspect of computer games is the artificial intelligence (AI)...
182
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...