2434 search results - page 207 / 487 » Algorithmic Randomness of Closed Sets |
142
click to vote
COLT
2003
Springer
15 years 9 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
152
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
142
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
142
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
This paper presents a probabilistic algorithm for segmenting and recognizing text embedded in video sequences. The algorithm approximates the posterior distribution of segmentatio...
141
click to vote
COMPGEOM
1993
ACM
15 years 8 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...