7150 search results - page 321 / 1430 » An Approximation Algorithm for Approximation Rank |
172
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
219
click to vote
HIPC
2007
Springer
15 years 10 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
188
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
156
click to vote
ACL
2004
15 years 8 months ago
2004
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
204
click to vote
IJCAI
2001
15 years 8 months ago
2001
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...