Sciweavers

727 search results - page 82 / 146
» Private approximation of search problems
Sort
View
118
Voted
ECCV
2002
Springer
16 years 2 months ago
Implicit Probabilistic Models of Human Motion for Synthesis and Tracking
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...
Hedvig Sidenbladh, Michael J. Black, Leonid Sigal
SIAMSC
2008
147views more  SIAMSC 2008»
15 years 20 days ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer
88
Voted
COMGEO
2010
ACM
15 years 5 months ago
GIRPharma: a geographic information retrieval approach to locate pharmacies on duty
This paper describes an approximation based on geographic information retrieval with the purpose to give some solutions to the problem of searching pharmacies on duty in the Spani...
Francisco M. Rangel Pardo, Loli Rangel Pardo, Davi...
ANNPR
2006
Springer
15 years 4 months ago
Support Vector Regression Using Mahalanobis Kernels
Abstract. In our previous work we have shown that Mahalanobis kernels are useful for support vector classifiers both from generalization ability and model selection speed. In this ...
Yuya Kamada, Shigeo Abe
107
Voted
MP
2006
137views more  MP 2006»
15 years 21 days ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher