Sciweavers

1453 search results - page 128 / 291
» A globally optimal algorithm for TTD-MDPs
Sort
View
WECWIS
2002
IEEE
129views ECommerce» more  WECWIS 2002»
14 years 2 months ago
On the Sensitivity of Incremental Algorithms for Combinatorial Auctions
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...
ICPR
2008
IEEE
14 years 10 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
14 years 1 months ago
Algorithms for a Simple Point Placement Problem
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
Joshua Redstone, Walter L. Ruzzo
ML
2007
ACM
192views Machine Learning» more  ML 2007»
13 years 8 months ago
Annealing stochastic approximation Monte Carlo algorithm for neural network training
We propose a general-purpose stochastic optimization algorithm, the so-called annealing stochastic approximation Monte Carlo (ASAMC) algorithm, for neural network training. ASAMC c...
Faming Liang
NIPS
2004
13 years 10 months ago
The Correlated Correspondence Algorithm for Unsupervised Registration of Nonrigid Surfaces
We present an unsupervised algorithm for registering 3D surface scans of an object undergoing significant deformations. Our algorithm does not need markers, nor does it assume pri...
Dragomir Anguelov, Praveen Srinivasan, Hoi-Cheung ...