Sciweavers

3240 search results - page 372 / 648
» Pre-aggregation with probability distributions
Sort
View
NETWORKING
2008
15 years 8 months ago
The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
Siyu Tang, Huijuan Wang, Piet Van Mieghem
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 8 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
15 years 8 months ago
Entropy-preserving cuttings and space-efficient planar point location
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...
Sunil Arya, Theocharis Malamatos, David M. Mount
FLAIRS
2000
15 years 8 months ago
A Deterministic Algorithm for Solving Imprecise Decision Problems
Today there are numerous tools for decision analysis, suitable both for human and artificial decision makers. Most of these tools require the decision maker to provide precise num...
Håkan L. S. Younes, Love Ekenberg
UAI
1998
15 years 8 months ago
Context-specific approximation in probabilistic inference
There is evidence that the numbers in probabilistic inference don't really matter. This paper considers the idea that we can make a probabilistic model simpler by making fewe...
David Poole