2168 search results - page 44 / 434 » Randomized Algorithms and Complexity Theory |
114
click to vote
JCSS
2006
15 years 2 months ago
2006
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
201
click to vote
PAMI
2006
15 years 2 months ago
2006
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
100
click to vote
ALGORITHMICA
2002
15 years 2 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
132
Voted
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
115
click to vote
INDOCRYPT
2004
Springer
15 years 8 months ago
2004
Springer
Random data perturbation (RDP) has been in use for several years in statistical databases and public surveys as a means of providing privacy to individuals while collecting informa...