2312 search results - page 140 / 463 » On the Dimensionality of Face Space |
156
click to vote
ICDM
2008
IEEE
16 years 27 days ago
2008
IEEE
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...
177
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
This paper describes our work in learning online models that forecast real-valued variables in a high-dimensional space. A 3GB database was collected by sampling 421 real-valued s...
208
click to vote
COCOON
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
170
click to vote
RSS
2007
15 years 7 months ago
2007
Abstract— We consider the task of omnidirectional path following for a quadruped robot: moving a four-legged robot along any arbitrary path while turning in any arbitrary manner....
161
click to vote
VISSYM
2004
15 years 7 months ago
2004
It is difficult for the average viewer to assimilate and comprehend huge amounts of high-dimensional data. It is important to present data in a way that allows the user a high lev...