1397 search results - page 36 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
JMLR
2010
13 years 3 months ago
2010
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
MST
2010
13 years 7 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
SSPR
2010
Springer
13 years 6 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
ENDM
2008
13 years 8 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
JCC
2008
13 years 8 months ago
2008
Abstract: We present a method for simultaneous three-dimensional (3D) structure generation and pharmacophorebased alignment using a self-organizing algorithm called Stochastic Prox...