854 search results - page 129 / 171 » Abstracting from Failure Probabilities |
118
click to vote
ASM
2004
ASM
15 years 7 months ago
2004
ASM
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
119
click to vote
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
Abstract. This paper presents a novel approach to unsupervised texture segmentation that relies on a very general nonparametric statistical model of image neighborhoods. The method...
130
click to vote
ECCV
2002
Springer
16 years 3 months ago
2002
Springer
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...
110
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
108
Voted
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...