Sciweavers

1093 search results - page 103 / 219
» Clustering from Constraint Graphs
Sort
View
111
Voted
JAIR
2010
130views more  JAIR 2010»
15 years 1 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...
ICML
2008
IEEE
16 years 4 months ago
Graph kernels between point clouds
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
Francis R. Bach
154
Voted
NIPS
2004
15 years 4 months ago
Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
Xiaojin Zhu, Jaz S. Kandola, Zoubin Ghahramani, Jo...
137
Voted
ICDAR
2009
IEEE
15 years 1 months ago
Graph b-Coloring for Automatic Recognition of Documents
In order to reduce the rejection rate of our automatic reading system, we propose to pre-classify the business documents by introducing an Automatic Recognition of Documents stage...
Djamel Gaceb, Véronique Eglin, Frank Lebour...
118
Voted
ICASSP
2010
IEEE
15 years 3 months ago
Song-level multi-pitch tracking by heavily constrained clustering
Given a set of monophonic, harmonic sound sources (e.g. human voices or wind instruments), multi-pitch estimation (MPE) is the task of determining the instantaneous pitches of eac...
Zhiyao Duan, Jinyu Han, Bryan Pardo