Sciweavers

213 search results - page 5 / 43
» Counting Independent Sets Using the Bethe Approximation
Sort
View
NIPS
2004
14 years 11 months ago
Expectation Consistent Free Energies for Approximate Inference
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...
Manfred Opper, Ole Winther
97
Voted
COCO
2007
Springer
142views Algorithms» more  COCO 2007»
15 years 3 months ago
Quantum t-designs: t-wise Independence in the Quantum World
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...
Andris Ambainis, Joseph Emerson
APPROX
2008
Springer
94views Algorithms» more  APPROX 2008»
14 years 11 months ago
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
Eden Chlamtac, Gyanit Singh
95
Voted
CIMAGING
2009
145views Hardware» more  CIMAGING 2009»
14 years 10 months ago
Wavelet-based Poisson rate estimation using the Skellam distribution
Owing to the stochastic nature of discrete processes such as photon counts in imaging, real-world data measurements often exhibit heteroscedastic behavior. In particular, time ser...
Keigo Hirakawa, Farhan A. Baqai, Patrick J. Wolfe
TC
1998
14 years 9 months ago
Resilient Authentication Using Path Independence
—Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a well-known technique for authenticating channels in a large distribut...
Michael K. Reiter, Stuart G. Stubblebine