Sciweavers

2200 search results - page 49 / 440
» Objective reduction using a feature selection technique
Sort
View
PAMI
2006
132views more  PAMI 2006»
13 years 9 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...
BMVC
2010
13 years 7 months ago
Iterative Hyperplane Merging: A Framework for Manifold Learning
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
Harry Strange, Reyer Zwiggelaar
ECWEB
2009
Springer
204views ECommerce» more  ECWEB 2009»
14 years 3 months ago
Computational Complexity Reduction for Factorization-Based Collaborative Filtering Algorithms
Abstract. Alternating least squares (ALS) is a powerful matrix factorization (MF) algorithm for both implicit and explicit feedback based recommender systems. We show that by using...
István Pilászy, Domonkos Tikk
ISCIS
2003
Springer
14 years 2 months ago
Comparison of Feature Sets Using Multimedia Translation
Feature selection is very important for many computer vision applications. However, it is hard to find a good measure for the comparison. In this study, feature sets are compared ...
Pinar Duygulu, Özge Can Özcanli, Norman ...
ASPDAC
1999
ACM
60views Hardware» more  ASPDAC 1999»
14 years 1 months ago
Timing Optimization of Logic Network Using Gate Duplication
We present a timing optimization algorithm based on the concept of gate duplication on the technologydecomposed network. We first examine the relationship between gate duplication...
Chun-hong Chen, Chi-Ying Tsui