1612 search results - page 182 / 323 » Analysing Randomized Distributed Algorithms |
108
Voted
NIPS
2007
15 years 4 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
115
click to vote
PODC
1990
ACM
15 years 6 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
133
Voted
WICON
2008
15 years 4 months ago
2008
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
140
Voted
DMIN
2008
15 years 4 months ago
2008
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
132
click to vote
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...