2084 search results - page 32 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ALGOSENSORS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
ALT
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
110
click to vote
AAAI
2012
13 years 1 days ago
2012
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
114
click to vote
ETT
2000
14 years 9 months ago
2000
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...