Sciweavers

188 search results - page 20 / 38
» An Algorithm for Solving Systems of Linear Diophantine Equat...
Sort
View
ADCM
2007
93views more  ADCM 2007»
13 years 7 months ago
Spectral behaviour of GMRES applied to singular systems
The purpose of this paper is to develop a spectral analysis of the Hessenberg matrix obtained by the GMRES algorithm used for solving a linear system with a singular matrix. We pr...
Laurent Smoch
ICRA
2008
IEEE
150views Robotics» more  ICRA 2008»
14 years 2 months ago
A Bayesian approach to empirical local linearization for robotics
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
Jo-Anne Ting, Aaron D'Souza, Sethu Vijayakumar, St...
FLAIRS
1998
13 years 9 months ago
An AI Approach to Computer Assisted Tomography
Computer assisted tomography (CAT) systems demandlarge amounts of time and space. In this paper, wedescribe an approachto solving the CAT problemusing several AItechniques includi...
John F. Kolen, David A. Shamma, Thomas Reichherzer...
SC
1994
ACM
13 years 11 months ago
A parallel formulation of interior point algorithms
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
George Karypis, Anshul Gupta, Vipin Kumar
COLT
2007
Springer
13 years 11 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...