Sciweavers

211 search results - page 1 / 43
» BoostMap: A Method for Efficient Approximate Similarity Rank...
Sort
View
CVPR
2004
IEEE
14 years 6 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
CIKM
2009
Springer
13 years 8 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
13 years 8 months ago
Ranking - Methods for Flexible Evaluation and Efficient Comparison of Classification Performance
We present the notion of Ranking for evaluation of two-class classifiers. Ranking is based on using the ordering information contained in the output of a scoring model, rather tha...
Saharon Rosset
SIAMMAX
2010
224views more  SIAMMAX 2010»
12 years 11 months ago
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
Jianlin Xia, Ming Gu
ASPDAC
2010
ACM
155views Hardware» more  ASPDAC 2010»
13 years 2 months ago
Efficient model reduction of interconnects via double gramians approximation
The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typi...
Boyuan Yan, Sheldon X.-D. Tan, Gengsheng Chen, Yic...