Sciweavers

4973 search results - page 425 / 995
» Probabilistic Algorithms in Robotics
Sort
View
JMLR
2010
143views more  JMLR 2010»
15 years 1 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii
IMC
2003
ACM
16 years 1 days ago
Bitmap algorithms for counting active flows on high speed links
—This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high-speed link. Such counting c...
Cristian Estan, George Varghese, Mike Fisk
ICDM
2003
IEEE
100views Data Mining» more  ICDM 2003»
16 years 2 days ago
Tractable Group Detection on Large Link Data Sets
Discovering underlying structure from co-occurrence data is an important task in a variety of fields, including: insurance, intelligence, criminal investigation, epidemiology, hu...
Jeremy Kubica, Andrew W. Moore, Jeff G. Schneider
UAI
2004
15 years 8 months ago
An Empirical Evaluation of Possible Variations of Lazy Propagation
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...
Andres Madsen
CVPR
2000
IEEE
16 years 8 months ago
Discriminant-EM Algorithm with Application to Image Retrieval
In Proc. of IEEE Conf. on CVPR'2000, Vol.I, pp.222-227, Hilton Head Island, SC, 2000 In many vision applications, the practice of supervised learning faces several difficulti...
Ying Wu, Qi Tian, Thomas S. Huang