Sciweavers

683 search results - page 100 / 137
» Generalization Bounds for Learning Kernels
Sort
View
AINA
2006
IEEE
13 years 11 months ago
Constrained Flooding: A Robust and Efficient Routing Framework for Wireless Sensor Networks
Flooding protocols for wireless networks in general have been shown to be very inefficient and therefore are mainly used in network initialization or route discovery and maintenan...
Ying Zhang, Markus P. J. Fromherz
ICCV
2009
IEEE
1419views Computer Vision» more  ICCV 2009»
15 years 12 days ago
On Feature Combination for Multiclass Object Classification
A key ingredient in the design of visual object classification systems is the identification of relevant class specific aspects while being robust to intra-class variations. Whil...
Peter Gehler, Sebastian Nowozin
ICML
2005
IEEE
14 years 8 months ago
Healing the relevance vector machine through augmentation
The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties ...
Carl Edward Rasmussen, Joaquin Quiñonero Ca...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 7 months ago
Online trading algorithms and robust option pricing
In this work we show how to use efficient online trading algorithms to price the current value of financial instruments, such as an option. We derive both upper and lower bounds f...
Peter DeMarzo, Ilan Kremer, Yishay Mansour
COLT
2008
Springer
13 years 9 months ago
On the Margin Explanation of Boosting Algorithms
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
Liwei Wang, Masashi Sugiyama, Cheng Yang, Zhi-Hua ...