Sciweavers

7006 search results - page 1254 / 1402
» Approximation Algorithms
Sort
View
149
Voted
ECAI
2006
Springer
15 years 8 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
ECCV
2006
Springer
15 years 8 months ago
Trace Quotient Problems Revisited
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
Shuicheng Yan, Xiaoou Tang
ECML
2006
Springer
15 years 8 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
GECCO
2006
Springer
150views Optimization» more  GECCO 2006»
15 years 8 months ago
Nonlinear parametric regression in genetic programming
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...
Yung-Keun Kwon, Sung-Soon Choi, Byung Ro Moon
3DIM
2003
IEEE
15 years 8 months ago
Efficient Reconstruction of Indoor Scenes with Color
In this paper we present an efficient and general approach to computing and integrating 3D distance fields directly from multiple range images. We compute normal and confidence va...
Rui Wang 0003, David P. Luebke
« Prev « First page 1254 / 1402 Last » Next »