1431 search results - page 40 / 287 » The complexity of random ordered structures |
81
Voted
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
72
Voted
AIRS
2006
Springer
15 years 1 months ago
2006
Springer
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
119
click to vote
MICCAI
2007
Springer
15 years 10 months ago
2007
Springer
We present an approach to detect anatomical structures by configurations of interest points, from a single example image. The representation of the configuration is based on Markov...
AAAI
1998
14 years 11 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...