2084 search results - page 216 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
PODC
2009
ACM
15 years 7 months ago
2009
ACM
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...
70
Voted
ARITH
2003
IEEE
15 years 3 months ago
2003
IEEE
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
107
click to vote
ALGORITHMICA
1998
14 years 10 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
MIDDLEWARE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper describes an event dissemination algorithm that impletopic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is...