Sciweavers

1661 search results - page 3 / 333
» Distributed Top-K Monitoring
Sort
View
SBP
2011
Springer
13 years 7 days ago
Ranking Information in Networks
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would l...
Tina Eliassi-Rad, Keith Henderson
EDBT
2011
ACM
209views Database» more  EDBT 2011»
12 years 8 months ago
An optimal strategy for monitoring top-k queries in streaming windows
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
Di Yang, Avani Shastri, Elke A. Rundensteiner, Mat...
CASCON
1996
196views Education» more  CASCON 1996»
13 years 6 months ago
Monitoring overhead in distributed systems: visualization and estimation techniques
Monitoring distributed systems involves the collection, analysis, and display of interactions among managed objects. These functions are carried out by the components of a monitor...
Hasina Abdu, Hanan Lutfi Lutfiyya, Michael A. Baue...
CCR
2006
117views more  CCR 2006»
13 years 5 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
13 years 6 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri