4377 search results - page 146 / 876 » Mass problems and randomness |
220
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
174
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
131
click to vote
ICIP
2006
IEEE
16 years 16 days ago
2006
IEEE
— In this paper, a de-interlacing algorithm to find the optimal deinterlaced results given accuracy-limited motion information is proposed. The de-interlacing process is formula...
170
click to vote
ISAAC
1997
Springer
15 years 10 months ago
1997
Springer
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
149
click to vote
COLING
2008
15 years 8 months ago
2008
Word clustering is a conventional and important NLP task, and the literature has suggested two kinds of approaches to this problem. One is based on the distributional similarity a...