Sciweavers

6251 search results - page 197 / 1251
» Randomness, Computability, and Density
Sort
View
ENTCS
2007
108views more  ENTCS 2007»
15 years 4 months ago
Simulating and Compiling Code for the Sequential Quantum Random Access Machine
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
Rajagopal Nagarajan, Nikolaos Papanikolaou, David ...
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 10 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
ICML
2005
IEEE
16 years 4 months ago
Variational Bayesian image modelling
We present a variational Bayesian framework for performing inference, density estimation and model selection in a special class of graphical models--Hidden Markov Random Fields (H...
Li Cheng, Feng Jiao, Dale Schuurmans, Shaojun Wang
SASO
2008
IEEE
15 years 10 months ago
Empirical Characterization of Discretization Error in Gradient-Based Algorithms
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
Jonathan Bachrach, Jacob Beal, Joshua Horowitz, Da...
SAMOS
2007
Springer
15 years 10 months ago
k  +   Neigh : An Energy Efficient Topology Control for Wireless Sensor Networks
For most applications in wireless sensor networks (WSNs), it is often assumed that the deployment of sensor nodes is unmanaged and random, so the density of local node may vary thr...
Dong-Min Son, Young-Bae Ko