2434 search results - page 127 / 487 » Algorithmic Randomness of Closed Sets |
172
click to vote
PCI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...
139
click to vote
ICRA
1994
IEEE
15 years 10 months ago
1994
IEEE
There is a close relationship between harmonic functions { which have recently been proposed for path planning { and hitting probabilities for random processes. The hitting probab...
177
click to vote
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
252
click to vote
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
151
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...