4377 search results - page 174 / 876 » Mass problems and randomness |
170
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...
144
click to vote
COLING
2010
15 years 1 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
220
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
190
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
152
click to vote
STACS
2005
Springer
16 years 17 hour ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...