35419 search results - page 6872 / 7084 » How are we doing |
142
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...
132
Voted
OSDI
2006
ACM
16 years 4 months ago
2006
ACM
Mismanagement of the persistent state of a system--all the executable files, configuration settings and other data that govern how a system functions--causes reliability problems,...
215
click to vote
VLDB
2004
ACM
16 years 4 months ago
2004
ACM
An increasing number of databases are becoming Web accessible through form-based search interfaces, and many of these sources are database-driven E-commerce sites. It is a daunting...
216
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
While there seems to be a general agreement that next years' systems will include many processing cores, it is often overlooked that these systems will also include an increa...
204
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...