2925 search results - page 124 / 585 » Information Complexity of Online Problems |
188
click to vote
ISNN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. This paper studies the extension of the Generalization Complexity (GC) measure to real valued input problems. The GC measure, defined in Boolean space, was proposed as a...
158
click to vote
WDAG
2007
Springer
16 years 16 days ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
166
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper addresses the problem of computing visual hulls from image contours. We propose a new hybrid approach which overcomes the precision-complexity trade-off inherent to vox...
184
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
We present a novel approach to detect multiscale keypoints using the Dual Tree Complex Wavelet Transform (DTCWT). We show that it is a well-suited basis for this problem as it is ...
146
click to vote
LPNMR
2009
Springer
16 years 29 days ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...