Sciweavers

4131 search results - page 481 / 827
» Compactness in Topology and Computation
Sort
View
172
Voted
IJRR
2006
145views more  IJRR 2006»
15 years 6 months ago
Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
ABSTRACT. We introduce tools from computational homology to verify coverage in an idealized sensor network. Our methods are unique in that, while they are coordinate-free and assum...
V. de Silva, R. Ghrist
JPDC
2008
92views more  JPDC 2008»
15 years 6 months ago
Techniques for pipelined broadcast on ethernet switched clusters
By splitting a large broadcast message into segments and broadcasting the segments in a pipelined fashion, pipelined broadcast can achieve high performance in many systems. In thi...
Pitch Patarasuk, Xin Yuan, Ahmad Faraj
ISEM
2007
81views more  ISEM 2007»
15 years 6 months ago
Interimistic data dissemination
Abstract We present low-overhead protocols for disseminating streaming data in an interimistic environment in which the availability of computers, networks, and other resources is ...
Sudarshan S. Chawathe, Abheek Anand
JCSS
2007
116views more  JCSS 2007»
15 years 6 months ago
The most probable annotation problem in HMMs and its application to bioinformatics
Hidden Markov models (HMMs) are often used for biological sequence annotation. Each sequence feature is represented by a collection of states with the same label. In annotating a ...
Brona Brejová, Daniel G. Brown 0001, Tom&aa...
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