Sciweavers

627 search results - page 39 / 126
» Structural Learning of Activities from Sparse Datasets
Sort
View
ICML
2009
IEEE
14 years 9 months ago
Boosting with structural sparsity
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
John Duchi, Yoram Singer
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 8 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
ECCV
2006
Springer
14 years 10 months ago
Conditional Infomax Learning: An Integrated Framework for Feature Extraction and Fusion
The paper introduces a new framework for feature learning in classification motivated by information theory. We first systematically study the information structure and present a n...
Dahua Lin, Xiaoou Tang
ECCV
2008
Springer
14 years 10 months ago
Learning Two-View Stereo Matching
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
Jianxiong Xiao, Jingni Chen, Dit-Yan Yeung, Long Q...
JMLR
2008
209views more  JMLR 2008»
13 years 8 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger