Sciweavers

2498 search results - page 143 / 500
» Algorithms for the Topological Watershed
Sort
View
JSS
1998
90views more  JSS 1998»
15 years 6 months ago
A taxonomy of distributed termination detection algorithms
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...
Jeff Matocha, Tracy Camp
SIGMOD
2006
ACM
170views Database» more  SIGMOD 2006»
16 years 6 months ago
Energy-efficient monitoring of extreme values in sensor networks
Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorit...
Adam Silberstein, Jun Yang 0001, Kamesh Munagala
WABI
2007
Springer
16 years 11 days ago
Bringing Folding Pathways into Strand Pairing Prediction
Abstract. The topology of β-sheets is defined by the pattern of hydrogenbonded strand pairing. Therefore, predicting hydrogen bonded strand partners is a fundamental step towards...
Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka
AUTOMATICA
2008
86views more  AUTOMATICA 2008»
15 years 6 months ago
Notes on averaging over acyclic digraphs and discrete coverage control
In this paper we study averaging algorithms and coverage control laws in a unified light. First, we characterize the convergence properties of averaging algorithms over acyclic di...
Chunkai Gao, Jorge Cortés, Francesco Bullo
SPAA
2004
ACM
15 years 11 months ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson