Sciweavers

587 search results - page 105 / 118
» Compactness of Loeb Spaces
Sort
View
DAGSTUHL
2007
13 years 8 months ago
Logical Particle Filtering
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
Luke S. Zettlemoyer, Hanna M. Pasula, Leslie Pack ...
PRL
2007
138views more  PRL 2007»
13 years 6 months ago
Ent-Boost: Boosting using entropy measures for robust object detection
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
Duy-Dinh Le, Shin'ichi Satoh
FGR
2008
IEEE
153views Biometrics» more  FGR 2008»
14 years 1 months ago
Facial image analysis using local feature adaptation prior to learning
Many facial image analysis methods rely on learningbased techniques such as Adaboost or SVMs to project classifiers based on the selection of local image filters (e.g., Haar and...
Rogerio Feris, Ying-li Tian, Yun Zhai, Arun Hampap...
INFOCOM
2006
IEEE
14 years 1 months ago
Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications
— A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive w...
Robert T. Schweller, Zhichun Li, Yan Chen, Yan Gao...
SPAA
2006
ACM
14 years 1 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi