3341 search results - page 123 / 669 » On Bounded Queries and Approximation |
IPL
2006
14 years 10 months ago
2006
At the heart of the Goldreich-Levin Theorem is the problem of determining an n-bit string a by making queries to two oracles, referred to as IP (inner product) and EQ (equivalence...
132
click to vote
ESA
2010
Springer
14 years 11 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
ISAAC
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
104
click to vote
COMBINATORICA
2010
14 years 5 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...