1397 search results - page 3 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
JPDC
2007
13 years 7 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
ICPR
2002
IEEE
14 years 9 days ago
2002
IEEE
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
SIAMJO
2008
13 years 7 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
PAAPP
1998
13 years 7 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
JMLR
2012
11 years 9 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...