220 search results - page 35 / 44 » The Forgiving Tree: A Self-Healing Distributed Data Structur... |
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
PG
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
— Existing stream processing systems are optimized for a specific metric, which may limit their applicability to diverse applications and environments. This paper presents XFlow...
108
click to vote
BMCBI
2010
14 years 9 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...