511 search results - page 33 / 103 » The intrinsic dimensionality of graphs |
TNN
2008
13 years 9 months ago
2008
Abstract--High-dimensional data are common in many domains, and dimensionality reduction is the key to cope with the curse-of-dimensionality. Linear discriminant analysis (LDA) is ...
ICPR
2006
IEEE
14 years 11 months ago
2006
IEEE
Many classification tasks benefit from integrating manifold learning and semi-supervised learning. By formulating the learning task in a semi-supervised manner, we propose a novel...
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
14 years 4 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
ICTAI
2008
IEEE
14 years 4 months ago
2008
IEEE
We present a fast iterative planner (FIP) that aims to handle planning problems involving nondeterministic actions. In contrast to existing iterative planners, FIP is built upon G...
AIRS
2006
Springer
14 years 1 months ago
2006
Springer
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...