584 search results - page 22 / 117 » On the Number of Halving Planes |
COMGEO
2008
ACM
13 years 9 months ago
2008
ACM
Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected ...
PKDD
2009
Springer
14 years 4 months ago
2009
Springer
We explore an algorithm for training SVMs with Kernels that can represent the learned rule using arbitrary basis vectors, not just the support vectors (SVs) from the training set. ...
ESANN
2007
13 years 11 months ago
2007
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
EOR
2007
13 years 9 months ago
2007
This paper considers the problem of locating M facilities on the unit square so as to minimize the maximal demand faced by each facility subject to closest assignments and coverag...
PAMI
2008
13 years 9 months ago
2008
In previous optimization-based methods of 3D planar-faced object reconstruction from single 2D line drawings, the missing depths of the vertices of a line drawing (and other parame...