3837 search results - page 491 / 768 » Learning Approximate Consistencies |
159
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
174
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
185
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
164
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We have developed a new Linear Support Vector Machine (SVM) training algorithm called OCAS. Its computational effort scales linearly with the sample size. In an extensive empirica...
206
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...