Sciweavers

3715 search results - page 596 / 743
» A Space Optimization for FP-Growth
Sort
View
LCTRTS
2005
Springer
15 years 11 months ago
Upper bound for defragmenting buddy heaps
Knuth’s buddy system is an attractive algorithm for managing storage allocation, and it can be made to operate in real-time. At some point, storage-management systems must eithe...
Delvin C. Defoe, Sharath R. Cholleti, Ron Cytron
PAM
2005
Springer
15 years 11 months ago
Scalable Coordination Techniques for Distributed Network Monitoring
Abstract. Emerging network monitoring infrastructures capture packetlevel traces or keep per-flow statistics at a set of distributed vantage points. Today, distributed monitors in...
Manish R. Sharma, John W. Byers
SSD
2005
Springer
153views Database» more  SSD 2005»
15 years 11 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
15 years 11 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 11 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis