1187 search results - page 149 / 238 » The Generalized Dimensionality Reduction Problem |
117
click to vote
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
Algorithms for feature selection fall into two broad categories: wrappers that use the learning algorithm itself to evaluate the usefulness of features and filters that evaluate f...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
REST
2010
ACM
15 years 2 months ago
2010
ACM
Traditionally, distributed computing problems have been solved by partitioning data into chunks able to be handled by commodity hardware. Such partitioning is not possible in case...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
IPCO
1992
14 years 11 months ago
1992
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...