872 search results - page 38 / 175 » Extreme lower probabilities |
132
click to vote
PODC
2005
ACM
15 years 9 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
169
click to vote
ICALP
1994
Springer
15 years 8 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
135
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
141
click to vote
IH
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetri...
141
click to vote
UAI
2003
15 years 5 months ago
2003
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...