Sciweavers

337 search results - page 10 / 68
» Efficient algorithms for ranking with SVMs
Sort
View
ICDE
2010
IEEE
254views Database» more  ICDE 2010»
15 years 11 months ago
Efficient Rank Based KNN Query Processing Over Uncertain Data
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
Ying Zhang, Xuemin Lin, Gaoping ZHU, Wenjie Zhang,...
WWW
2005
ACM
16 years 10 days ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
NIPS
2004
15 years 1 months ago
Parallel Support Vector Machines: The Cascade SVM
We describe an algorithm for support vector machines (SVM) that can be parallelized efficiently and scales to very large problems with hundreds of thousands of training vectors. I...
Hans Peter Graf, Eric Cosatto, Léon Bottou,...
75
Voted
NA
2008
80views more  NA 2008»
14 years 11 months ago
Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
In this paper we address the problem of efficiently computing all the eigenvalues of a large N
Yuli Eidelman, Luca Gemignani, Israel Gohberg
AAAI
2008
15 years 2 months ago
Semi-Supervised Ensemble Ranking
Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance b...
Steven C. H. Hoi, Rong Jin