Sciweavers

2421 search results - page 157 / 485
» Approximate Flow-Aware Networking
Sort
View
131
Voted
NN
1997
Springer
174views Neural Networks» more  NN 1997»
15 years 7 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
160
Voted
ALGOSENSORS
2007
Springer
15 years 7 months ago
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
Sotiris E. Nikoletseas, Paul G. Spirakis
SIGMOD
2007
ACM
105views Database» more  SIGMOD 2007»
16 years 3 months ago
Sonnet: an efficient distributed content-based dissemination broker
In this demonstration, we present a prototype content-based dissemination broker, called Sonnet, which is built upon structured overlay network. It combines approximate filtering ...
Aoying Zhou, Weining Qian, Xueqing Gong, Minqi Zho...
144
Voted
DSN
2007
IEEE
15 years 9 months ago
Variational Bayesian Approach for Interval Estimation of NHPP-Based Software Reliability Models
In this paper, we present a variational Bayesian (VB) approach to computing the interval estimates for nonhomogeneous Poisson process (NHPP) software reliability models. This appr...
Hiroyuki Okamura, Michael Grottke, Tadashi Dohi, K...
JCO
2008
134views more  JCO 2008»
15 years 3 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...