223 search results - page 39 / 45 » Proving Termination by Bounded Increase |
ISAAC
2005
Springer
15 years 2 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
ICDCS
1997
IEEE
15 years 1 months ago
1997
IEEE
Fault-tolerance techniques based on checkpointing and message logging have been increasingly used in real-world applications to reduce service down-time. Most industrial applicati...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
Questions about order versus disorder in systems and models have been fascinating scientists over the years. In Computer Science, order is intimately related to sorting, commonly ...
NIPS
2008
14 years 11 months ago
2008
Hierarchical probabilistic modeling of discrete data has emerged as a powerful tool for text analysis. Posterior inference in such models is intractable, and practitioners rely on...
DC
2010
14 years 9 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...