338 search results - page 37 / 68 » Fast distributed random walks |
112
click to vote
CP
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
68
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
ICCV
2001
IEEE
15 years 11 months ago
2001
IEEE
This paper deals with the problem of incorporating natural regularity conditions on the motion in an MAP estimator for structure and motion recovery from uncalibrated image sequen...
88
Voted
VALUETOOLS
2006
ACM
15 years 3 months ago
2006
ACM
We continue the study of zero-automatic queues first introduced in [3]. These queues are characterized by a special buffering mechanism evolving like a random walk on some infi...
86
Voted
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where ac...