Sciweavers

235 search results - page 13 / 47
» Compiling Bayesian Networks Using Variable Elimination
Sort
View
NN
1997
Springer
174views Neural Networks» more  NN 1997»
14 years 26 days 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
CJ
2010
131views more  CJ 2010»
13 years 6 months ago
Probabilistic Approaches to Estimating the Quality of Information in Military Sensor Networks
an be used to abstract away from the physical reality by describing it as components that exist in discrete states with probabilistically invoked actions that change the state. The...
Duncan Gillies, David Thornley, Chatschik Bisdikia...
ICML
2006
IEEE
14 years 9 months ago
Full Bayesian network classifiers
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
Jiang Su, Harry Zhang
ISLPED
2004
ACM
139views Hardware» more  ISLPED 2004»
14 years 2 months ago
Eliminating voltage emergencies via microarchitectural voltage control feedback and dynamic optimization
Microprocessor designers use techniques such as clock gating to reduce power dissipation. An unfortunate side-effect of these techniques is the processor current fluctuations th...
Kim M. Hazelwood, David Brooks
PLDI
2003
ACM
14 years 2 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers