Sciweavers

115 search results - page 1 / 23
» The Complexity of List Ranking of Trees
Sort
View
ARSCOM
2008
111views more  ARSCOM 2008»
13 years 11 months ago
The Complexity of List Ranking of Trees
Dariusz Dereniowski
IKE
2003
14 years 4 days ago
A Tree-Based inverted File for Fast Ranked-Document Retrieval
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
Wann-Yun Shieh, Tien-Fu Chen, Chung-Ping Chung
RECSYS
2010
ACM
13 years 8 months ago
List-wise learning to rank with matrix factorization for collaborative filtering
A ranking approach, ListRank-MF, is proposed for collaborative filtering that combines a list-wise learning-to-rank algorithm with matrix factorization (MF). A ranked list of item...
Yue Shi, Martha Larson, Alan Hanjalic
IPPS
2010
IEEE
13 years 8 months ago
Parallel external memory graph algorithms
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
Lars Arge, Michael T. Goodrich, Nodari Sitchinava
CIKM
2010
Springer
13 years 8 months ago
Computing the top-k maximal answers in a join of ranked lists
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
Mirit Shalem, Yaron Kanza