Sciweavers

5448 search results - page 819 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
PODC
2003
ACM
15 years 12 months ago
Performing work with asynchronous processors: message-delay-sensitive bounds
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
Dariusz R. Kowalski, Alexander A. Shvartsman
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
15 years 10 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
DCOSS
2006
Springer
15 years 10 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
DEBS
2008
ACM
15 years 7 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
BMCBI
2004
100views more  BMCBI 2004»
15 years 6 months ago
Handling multiple testing while interpreting microarrays with the Gene Ontology Database
Background: The development of software tools that analyze microarray data in the context of genetic knowledgebases is being pursued by multiple research groups using different me...
Michael V. Osier, Hongyu Zhao, Kei-Hoi Cheung