Sciweavers

316 search results - page 51 / 64
» Top-K aggregation queries over large networks
Sort
View
JCDL
2009
ACM
162views Education» more  JCDL 2009»
15 years 4 months ago
Supporting analysis of future-related information in news archives and the web
A lot of future-related information is available in news articles or Web pages. This information can however differ to large extent and may fluctuate over time. It is therefore di...
Adam Jatowt, Kensuke Kanazawa, Satoshi Oyama, Kats...
EUROPAR
2005
Springer
15 years 3 months ago
PerfMiner: Cluster-Wide Collection, Storage and Presentation of Application Level Hardware Performance Data
Abstract. We present PerfMiner, a system for the transparent collection, storage and presentation of thread-level hardware performance data across an entire cluster. Every sub-proc...
Philip Mucci, Daniel Ahlin, Johan Danielsson, Per ...
EDBT
2009
ACM
116views Database» more  EDBT 2009»
15 years 2 months ago
Ranking objects based on relationships and fixed associations
Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically ...
Albert Angel, Surajit Chaudhuri, Gautam Das, Nick ...
HPDC
2003
IEEE
15 years 3 months ago
Distributed Pagerank for P2P Systems
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
Karthikeyan Sankaralingam, Simha Sethumadhavan, Ja...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
15 years 10 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes