2084 search results - page 171 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
121
Voted
ESA
2004
Springer
15 years 10 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
117
click to vote
COLT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but r...
156
click to vote
WCNC
2010
IEEE
15 years 9 months ago
2010
IEEE
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
119
Voted
COLT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
142
click to vote
GD
2004
Springer
15 years 10 months ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...