Sciweavers

507 search results - page 48 / 102
» Efficient Approximate Wordlength Optimization
Sort
View
NECO
2008
112views more  NECO 2008»
14 years 9 months ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel
CGF
2004
108views more  CGF 2004»
14 years 9 months ago
Interference Detection for Subdivision Surfaces
Accurate and robust interference detection and ray-tracing of subdivision surfaces requires safe linear approximations. Approximation of the limit surface by the subdivided contro...
Xiaobin Wu, Jörg Peters
UAI
2004
14 years 11 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes
ML
2008
ACM
14 years 9 months ago
Large margin vs. large volume in transductive learning
Abstract. We consider a large volume principle for transductive learning that prioritizes the transductive equivalence classes according to the volume they occupy in hypothesis spa...
Ran El-Yaniv, Dmitry Pechyony, Vladimir Vapnik
PE
2006
Springer
145views Optimization» more  PE 2006»
14 years 9 months ago
Closed form solutions for mapping general distributions to quasi-minimal PH distributions
Approximating general distributions by phase-type (PH) distributions is a popular technique in stochastic analysis, since the Markovian property of PH distributions often allows a...
Takayuki Osogami, Mor Harchol-Balter