2434 search results - page 42 / 487 » Algorithmic Randomness of Closed Sets |
135
click to vote
SODA
1998
ACM
15 years 3 months ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
123
click to vote
CCA
2009
Springer
15 years 8 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
139
click to vote
CISIS
2008
IEEE
15 years 8 months ago
2008
IEEE
Liver segmentation from scans of the abdominal area is an important step in several diagnostic processes. CT scans of the abdominal area contain several organs in close proximity ...
145
click to vote
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
100
click to vote
PVLDB
2008
15 years 1 months ago
2008
We study selectivity estimation techniques for set similarity queries. A wide variety of similarity measures for sets have been proposed in the past. In this work we concentrate o...