2957 search results - page 191 / 592 » The Complexity of Polynomial-Time Approximation |
183
click to vote
ESANN
2006
15 years 7 months ago
2006
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
183
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
162
click to vote
ICIP
2002
IEEE
16 years 7 months ago
2002
IEEE
A transform approximation is explored for speeding up the software compression of images and video. It is used to replace the regular DCT whenever only few DCT coefficients are ac...
117
click to vote
ECCC
2010
15 years 6 months ago
2010
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...
162
click to vote
JC
1998
15 years 5 months ago
1998
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...