Sciweavers

581 search results - page 35 / 117
» EM in High Dimensional Spaces
Sort
View
IPPS
1998
IEEE
15 years 3 months ago
Improved Concurrency Control Techniques For Multi-Dimensional Index Structures
Multi-dimensional index structures such as R-trees enable fast searching in high-dimensional spaces. They differ from uni-dimensional structures in the following aspects: (1) inde...
Kothuri Venkata Ravi Kanth, David Serena, Ambuj K....
PAMI
2007
102views more  PAMI 2007»
14 years 10 months ago
Feature Subset Selection and Ranking for Data Dimensionality Reduction
—A new unsupervised forward orthogonal search (FOS) algorithm is introduced for feature selection and ranking. In the new algorithm, features are selected in a stepwise way, one ...
Hua-Liang Wei, Stephen A. Billings
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
15 years 11 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
IJCNN
2006
IEEE
15 years 4 months ago
Bi-directional Modularity to Learn Visual Servoing Tasks
— This paper shows the advantage of using neural network modularity over conventional learning schemes to approximate complex functions. Indeed, it is difficult for artificial ...
Gilles Hermann, Patrice Wira, Jean-Philippe Urban
CGF
2010
144views more  CGF 2010»
14 years 11 months ago
Dynamic Multi-View Exploration of Shape Spaces
Statistical shape modeling is a widely used technique for the representation and analysis of the shapes and shape variations present in a population. A statistical shape model mod...
Stef Busking, Charl P. Botha, Frits H. Post