1284 search results - page 143 / 257 » Data Structures for Mergeable Trees |
123
click to vote
STOC
2004
ACM
16 years 2 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...
134
click to vote
PLDI
2011
ACM
14 years 5 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
133
click to vote
CIDM
2007
IEEE
15 years 2 months ago
2007
IEEE
Data stream applications like sensor network data, click stream data, have data arriving continuously at high speed rates and require online mining process capable of delivering c...
113
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
139
click to vote
WCRE
2000
IEEE
15 years 6 months ago
2000
IEEE
The purpose of this panel is to report on a structured demonstration for comparing program comprehension tools. Five program comprehension tool designers applied their tools to a ...