Sciweavers

809 search results - page 132 / 162
» Troubleshooting using probabilistic networks and value of in...
Sort
View
PODS
2006
ACM
96views Database» more  PODS 2006»
14 years 7 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
RECOMB
2010
Springer
14 years 2 months ago
Incremental Signaling Pathway Modeling by Data Integration
Constructing quantitative dynamic models of signaling pathways is an important task for computational systems biology. Pathway model construction is often an inherently incremental...
Geoffrey Koh, David Hsu, P. S. Thiagarajan
IJCNN
2006
IEEE
14 years 1 months ago
Learning to Segment Any Random Vector
— We propose a method that takes observations of a random vector as input, and learns to segment each observation into two disjoint parts. We show how to use the internal coheren...
Aapo Hyvärinen, Jukka Perkiö
EUC
2004
Springer
14 years 24 days ago
Invalidation for CORBA Caching in Wireless Devices
Wireless devices are widely used to get some information from the Internet. However, limited bandwidth, frequent disconnections and different communication protocols are most comm...
James Jayaputera, David Taniar
PODC
2006
ACM
14 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah