Sciweavers

2018 search results - page 99 / 404
» Magnitude-preserving ranking algorithms
Sort
View
WADS
2009
Springer
257views Algorithms» more  WADS 2009»
16 years 24 days ago
Rank-Balanced Trees
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
CORR
2008
Springer
92views Education» more  CORR 2008»
15 years 6 months ago
Nonnegative Matrix Factorization via Rank-One Downdate
Nonnegative matrix factorization (NMF) was popularized as a tool for data mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with nonnegative entries by a produ...
Michael Biggs, Ali Ghodsi, Stephen A. Vavasis
SIGIR
2003
ACM
15 years 11 months ago
Exploiting query history for document ranking in interactive information retrieval
In this poster,we incorporate user query history, as context information, to improve the retrieval performance in interactive retrieval. Experiments using the TREC data show that ...
Xuehua Shen, ChengXiang Zhai
TSP
2008
110views more  TSP 2008»
15 years 5 months ago
Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
In this paper, we present a powerful technique for the blind extraction of direct-sequence code-division multiple access (DS-CDMA) signals from convolutive mixtures received by an ...
Lieven De Lathauwer, Alexandre de Baynast
ECWEB
2010
Springer
155views ECommerce» more  ECWEB 2010»
15 years 4 months ago
Partial Ranking of Products for Recommendation Systems
A recommendation system (or recommender) is an algorithm whose goal is to recommend products to potential users. To achieve its task, it uses information about some user preference...
Sébastien Hémon, Thomas Largillier, ...