Sciweavers

3708 search results - page 696 / 742
» Approximating Betweenness Centrality
Sort
View
SPAA
2006
ACM
14 years 3 months ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
ECRTS
2005
IEEE
14 years 3 months ago
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...
James H. Anderson, Vasile Bud, UmaMaheswari C. Dev...
RTAS
2005
IEEE
14 years 3 months ago
Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns
While caches have become invaluable for higher-end architectures due to their ability to hide, in part, the gap between processor speed and memory access times, caches (and partic...
Harini Ramaprasad, Frank Mueller
SIGUCCS
2005
ACM
14 years 3 months ago
Imaging, security, configuration, and maintenance for the masses
Educational Partnerships and Learning Technologies (EPLT) [1] at the University of Washington maintains and supports a fleet of approximately 1,000 general-access student computin...
Brandon Koeller, Karalee Woody
AIIA
2005
Springer
14 years 3 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut