2434 search results - page 260 / 487 » Algorithmic Randomness of Closed Sets |
142
click to vote
KDD
2003
ACM
16 years 4 months ago
2003
ACM
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
131
click to vote
WG
1993
Springer
15 years 8 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
144
click to vote
FUIN
2008
15 years 4 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
130
click to vote
TIP
2010
14 years 10 months ago
2010
One weakness in the existing interactive image segmentation algorithms is the lack of more intelligent ways to understand the intention of user inputs. In this paper, we advocate t...
129
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Quantization is intrinsic to several data acquisition systems. This process is especially important in distributed settings, where observations must rst be compressed before they ...