827 search results - page 23 / 166 » The Complexity of Probabilistic Lobbying |
101
click to vote
IPL
2010
15 years 8 days ago
2010
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
213
Voted
DCOSS
2011
Springer
14 years 1 months ago
2011
Springer
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
133
click to vote
TCAD
1998
15 years 1 months ago
1998
—This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretica...
108
click to vote
STOC
1991
ACM
15 years 5 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
140
click to vote
ECCV
2008
Springer
15 years 2 months ago
2008
Springer
This paper presents a probabilistic grammar approach to the recognition of complex events in videos. Firstly, based on the original motion features, a rule induction algorithm is a...