Sciweavers

3495 search results - page 241 / 699
» On the random satisfiable process
Sort
View
CVPR
2007
IEEE
16 years 9 months ago
Detector Ensemble
Component-based detection methods have demonstrated their promise by integrating a set of part-detectors to deal with large appearance variations of the target. However, an essent...
Shengyang Dai, Ming Yang, Ying Wu, Aggelos K. Kats...
ECCV
2002
Springer
16 years 9 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
ICDE
1996
IEEE
157views Database» more  ICDE 1996»
16 years 8 months ago
High Availability in Clustered Multimedia Servers
Clustered multimedia servers, consisting of interconnected nodes and disks, have been proposed for large scale servers, that are capable of supporting multiple concurrent streams ...
Renu Tewari, Daniel M. Dias, Rajat Mukherjee, Harr...
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
16 years 7 months ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio
DCC
2001
IEEE
16 years 6 months ago
A Posteriori Quantized Matching Pursuit
This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit pr...
Pascal Frossard, Pierre Vandergheynst