Sciweavers

5785 search results - page 213 / 1157
» Approximability of Probability Distributions
Sort
View
ECCC
2010
86views more  ECCC 2010»
15 years 4 months ago
On Approximating the Entropy of Polynomial Mappings
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P...
NECO
2008
146views more  NECO 2008»
15 years 4 months ago
Deep, Narrow Sigmoid Belief Networks Are Universal Approximators
In this paper we show that exponentially deep belief networks [3, 7, 4] can approximate any distribution over binary vectors to arbitrary accuracy, even when the width of each lay...
Ilya Sutskever, Geoffrey E. Hinton
STOC
2006
ACM
180views Algorithms» more  STOC 2006»
16 years 4 months ago
Pricing for fairness: distributed resource allocation for multiple objectives
In this paper, we present a simple distributed algorithm for resource allocation which simultaneously approximates the optimum value for a large class of objective functions. In p...
Sung-woo Cho, Ashish Goel
FUIN
2010
143views more  FUIN 2010»
15 years 1 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
CVPR
2005
IEEE
16 years 6 months ago
Efficient Image Matching with Distributions of Local Invariant Features
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
Kristen Grauman, Trevor Darrell