Sciweavers

608 search results - page 90 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
UAI
2008
13 years 9 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Solving Hidden Number Problem with One Bit Oracle and Advice
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
Adi Akavia
JCSS
2008
120views more  JCSS 2008»
13 years 7 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
NIPS
2008
13 years 9 months ago
Non-stationary dynamic Bayesian networks
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
Joshua W. Robinson, Alexander J. Hartemink
BMCBI
2010
121views more  BMCBI 2010»
13 years 2 months ago
G-stack modulated probe intensities on expression arrays - sequence corrections and signal calibration
Background: The brightness of the probe spots on expression microarrays intends to measure the abundance of specific mRNA targets. Probes with runs of at least three guanines (G) ...
Mario Fasold, Peter F. Stadler, Hans Binder