220 search results - page 32 / 44 » New degree bounds for polynomial threshold functions |
NIPS
2007
13 years 9 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
ICALP
2004
Springer
14 years 27 days ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
IJCAI
1993
13 years 8 months ago
1993
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
ECCC
2007
13 years 7 months ago
2007
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...