Sciweavers

226 search results - page 23 / 46
» How to learn a graph from smooth signals
Sort
View
NIPS
2004
15 years 3 months ago
Contextual Models for Object Detection Using Boosted Random Fields
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
Antonio Torralba, Kevin P. Murphy, William T. Free...
ICASSP
2011
IEEE
14 years 5 months ago
Robust nonparametric regression by controlling sparsity
Nonparametric methods are widely applicable to statistical learning problems, since they rely on a few modeling assumptions. In this context, the fresh look advocated here permeat...
Gonzalo Mateos, Georgios B. Giannakis
ICML
2005
IEEE
16 years 2 months ago
Optimal assignment kernels for attributed molecular graphs
We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another ...
Andreas Zell, Florian Sieker, Holger Fröhlich...
MIR
2006
ACM
223views Multimedia» more  MIR 2006»
15 years 8 months ago
Adaptive image retrieval using a Graph model for semantic feature integration
The variety of features available to represent multimedia data constitutes a rich pool of information. However, the plethora of data poses a challenge in terms of feature selectio...
Jana Urban, Joemon M. Jose
ICMLA
2004
15 years 3 months ago
Two new regularized AdaBoost algorithms
AdaBoost rarely suffers from overfitting problems in low noise data cases. However, recent studies with highly noisy patterns clearly showed that overfitting can occur. A natural s...
Yijun Sun, Jian Li, William W. Hager