Sciweavers

600 search results - page 106 / 120
» Validated cost models for sensor network queries
Sort
View
CCR
2006
117views more  CCR 2006»
14 years 11 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
BMCBI
2006
175views more  BMCBI 2006»
14 years 11 months ago
Parameter estimation for stiff equations of biosystems using radial basis function networks
Background: The modeling of dynamic systems requires estimating kinetic parameters from experimentally measured time-courses. Conventional global optimization methods used for par...
Yoshiya Matsubara, Shinichi Kikuchi, Masahiro Sugi...
BTW
2005
Springer
142views Database» more  BTW 2005»
15 years 5 months ago
Self-Extending Peer Data Management
Abstract: Peer data management systems (PDMS) are the natural extension of integrated information systems. Conventionally, a single integrating system manages an integrated schema,...
Ralf Heese, Sven Herschel, Felix Naumann, Armin Ro...
SAC
2005
ACM
15 years 5 months ago
Indexing continuously changing data with mean-variance tree
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...
Yuni Xia, Sunil Prabhakar, Shan Lei, Reynold Cheng...
EWSN
2009
Springer
16 years 7 days ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...