Sciweavers

1210 search results - page 18 / 242
» Newton's method and its use in optimization
Sort
View
CODES
2005
IEEE
14 years 1 months ago
Novel architecture for loop acceleration: a case study
In this paper, we show a novel approach to accelerate loops by tightly coupling a coprocessor to an ASIP. Latency hiding is used to exploit the parallelism available in this archi...
Seng Lin Shee, Sri Parameswaran, Newton Cheung
UAI
2003
13 years 9 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
AAAI
2010
13 years 9 months ago
A Single-Step Maximum A Posteriori Update for Bearing-Only SLAM
This paper presents a novel recursive maximum a posteriori update for the Kalman formulation of undelayed bearing-only SLAM. The estimation update step is cast as an optimization ...
Stephen Tully, George Kantor, Howie Choset
CSDA
2007
136views more  CSDA 2007»
13 years 7 months ago
A note on iterative marginal optimization: a simple algorithm for maximum rank correlation estimation
The maximum rank correlation (MRC) estimator was originally studied by Han [1987. Nonparametric analysis of a generalized regression model. J. Econometrics 35, 303–316] and Sher...
Hansheng Wang
GECCO
2006
Springer
121views Optimization» more  GECCO 2006»
13 years 11 months ago
A splicing/decomposable encoding and its novel operators for genetic algorithms
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
Yong Liang, Kwong-Sak Leung, Kin-Hong Lee