Sciweavers

1129 search results - page 12 / 226
» Modular Ranking Abstraction
Sort
View
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 9 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
SEMWEB
2009
Springer
14 years 2 months ago
TripleRank: Ranking Semantic Web Data by Tensor Decomposition
Abstract. The Semantic Web fosters novel applications targeting a more efficient and satisfying exploitation of the data available on the web, e.g. faceted browsing of linked open...
Thomas Franz, Antje Schultz, Sergej Sizov, Steffen...
EUROPAR
2007
Springer
14 years 1 months ago
Grid Resource Ranking Using Low-Level Performance Measurements
Abstract. This paper outlines a feasible approach to ranking Grid resources based on an easily obtainable application-specific performance model utilizing low-level performance me...
George Tsouloupas, Marios D. Dikaiakos
ECOOP
2005
Springer
14 years 1 months ago
Expressive Pointcuts for Increased Modularity
Abstract. In aspect-oriented programming, pointcuts are used to describe crossstructure. Pointcuts that abstract over irrelevant implementation details are clearly desired to bette...
Klaus Ostermann, Mira Mezini, Christoph Bockisch
ECIR
2007
Springer
13 years 9 months ago
Popularity Weighted Ranking for Academic Digital Libraries
Abstract. We propose a popularity weighted ranking algorithm for academic digital libraries that uses the popularity factor of a publication venue overcoming the limitations of imp...
Yang Sun, C. Lee Giles