1489 search results - page 25 / 298 » Optimizing Feature Sets for Structured Data |
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
In this work, two new techniques for non-linear feature extraction are presented. In these techniques, new features are obtained as radial projections of the original measurements...
PPOPP
2011
ACM
12 years 10 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
PKDD
2005
Springer
14 years 1 months ago
2005
Springer
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
TLDI
2005
ACM
14 years 1 months ago
2005
ACM
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
JGTOOLS
2008
13 years 7 months ago
2008
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...