3946 search results - page 63 / 790 » The computational complexity of choice sets |
114
click to vote
DAM
2011
14 years 6 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
ICPR
2004
IEEE
16 years 28 days ago
2004
IEEE
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
121
click to vote
ISNN
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Nonlinear component analysis is a popular nonlinear feature extraction method. It generally uses eigen-decomposition technique to extract the principal components. But th...
102
click to vote
ICCTA
2007
IEEE
15 years 6 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
COORDINATION
2004
Springer
15 years 5 months ago
2004
Springer
A development environment for applications specified in an extended version of a previously developed coordination model based on associatively broadcast interactions is presented....