2479 search results - page 315 / 496 » Random Event Structures |
126
Voted
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
147
click to vote
SIGMOD
2001
ACM
16 years 2 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
119
click to vote
BMCBI
2006
15 years 2 months ago
2006
Background: The exploration of the structural topology and the organizing principles of genomebased large-scale metabolic networks is essential for studying possible relations bet...
154
click to vote
MST
2006
15 years 2 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
116
Voted
DAC
2009
ACM
16 years 3 months ago
2009
ACM
Traditionally, synchronous languages, such as Esterel, have been compiled into hardware, where timing analysis is relatively easy. When compiled into software ? e.g., into sequent...