Sciweavers

106 search results - page 18 / 22
» Average Case Analysis for Tree Labelling Schemes
Sort
View
97
Voted
VRST
2003
ACM
15 years 2 months ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
14 years 11 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
INFOCOM
1999
IEEE
15 years 1 months ago
Multicast-Based Inference of Network-Internal Characteristics: Accuracy of Packet Loss Estimation
Abstract--We explore the use of end-to-end multicast traffic as measurement probes to infer network-internal characteristics. We have developed in an earlier paper [2] a Maximum Li...
Ramón Cáceres, Nick G. Duffield, Jos...
94
Voted
LCTRTS
2009
Springer
15 years 4 months ago
A compiler optimization to reduce soft errors in register files
Register file (RF) is extremely vulnerable to soft errors, and traditional redundancy based schemes to protect the RF are prohibitive not only because RF is often in the timing c...
Jongeun Lee, Aviral Shrivastava
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 9 months ago
To Feed or Not to Feed Back
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman