Sciweavers

2569 search results - page 100 / 514
» Approximate Objects and Approximate Theories
Sort
View
MP
2002
176views more  MP 2002»
15 years 6 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
SIAMCO
2002
71views more  SIAMCO 2002»
15 years 6 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
TSMC
2010
15 years 1 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
CIKM
2006
Springer
15 years 10 months ago
Amnesic online synopses for moving objects
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
ICCV
1999
IEEE
16 years 8 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih