4276 search results - page 73 / 856 » Computability of Probability Distributions and Distribution ... |
119
Voted
PODC
1997
ACM
15 years 7 months ago
1997
ACM
In an anonymous network processors have no distinct identifiers. For any class of anonymous networks, we characterize effectively the vector functions f : n → n which are compu...
139
click to vote
PDP
2007
IEEE
15 years 10 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
136
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
131
Voted
ICDCN
2009
Springer
15 years 10 months ago
2009
Springer
Chandy et al. proposed the methodology of “self-similar algorithms” for distributed computation in dynamic environments. We further characterize the class of functions computab...
131
click to vote
CVPR
1999
IEEE
16 years 5 months ago
1999
IEEE
We consider a problem central in aerial visual surveillance applications { detection and tracking of small, independently moving objects in long and noisy video sequences. We dire...