7930 search results - page 481 / 1586 » Greedy in Approximation Algorithms |
158
click to vote
NIPS
2007
15 years 8 months ago
2007
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...
209
click to vote
ESANN
2006
15 years 8 months ago
2006
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
235
click to vote
ENTCS
2006
15 years 7 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
193
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
172
click to vote
CVIU
2008
15 years 6 months ago
2008
The estimation of parametric global motion is one of the cornerstones of computer vision. Such schemes are able to estimate various motion models (translation, rotation, affine, p...