534 search results - page 13 / 107 » Efficient polynomial L-approximations |
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
IJCAI
2001
13 years 9 months ago
2001
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
PAMI
2010
13 years 6 months ago
2010
—Representing 2D and 3D data sets with implicit polynomials (IPs) has been attractive because of its applicability to various computer vision issues. Therefore, many IP fitting m...