2957 search results - page 209 / 592 » The Complexity of Polynomial-Time Approximation |
151
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
134
click to vote
ISVC
2007
Springer
16 years 22 days ago
2007
Springer
Schlick’s approximation of the term xp is used primarily to reduce the complexity of specular lighting calculations in graphics applications. Since moment functions have a kernel...
167
click to vote
WSC
2001
15 years 8 months ago
2001
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
177
click to vote
NIPS
2003
15 years 8 months ago
2003
We consider the question of how well a given distribution can be approximated with probabilistic graphical models. We introduce a new parameter, effective treewidth, that captures...
167
click to vote
JMLR
2006
15 years 6 months ago
2006
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...