Sciweavers

573 search results - page 84 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 8 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
MICCAI
2010
Springer
13 years 7 months ago
Understanding the Optics to Aid Microscopy Image Segmentation
Abstract. Image segmentation is essential for many automated microscopy image analysis systems. Rather than treating microscopy images as general natural images and rushing into th...
Zhaozheng Yin, Kang Li, Takeo Kanade, Mei Chen
TOMS
2011
101views more  TOMS 2011»
13 years 4 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...
ICRA
2003
IEEE
163views Robotics» more  ICRA 2003»
14 years 2 months ago
An experimental study of hybrid switched system approaches to visual servoing
Abstract— In the recent past, many researchers have developed control algorithms for visual servo applications. In this paper, we introduce a new hybrid switched system approach,...
Nicholas R. Gans, Seth Hutchinson
FLAIRS
2008
13 years 11 months ago
Distributed University Timetabling with Multiply Sectioned Constraint Networks
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
Yang Xiang, Wanling Zhang