Sciweavers

573 search results - page 40 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
14 years 24 days ago
A Randomized Solver for Linear Systems with Exponential Convergence
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
Thomas Strohmer, Roman Vershynin
CVPR
2010
IEEE
14 years 2 months ago
Pushing the Envelope of Modern Methods for Bundle Adjustment
In this paper, we present results and experiments with several methods for bundle adjustment, producing the fastest bundle adjuster ever published. The fastest methods work with t...
Yekeun Jeong, David Nister, Drew Steedly, Richard ...
HYBRID
2001
Springer
14 years 1 months ago
Design of Luenberger Observers for a Class of Hybrid Linear Systems
An approach to estimation for a class of hybrid discrete-time linear systems using Luenberger observers is presented. The proposed Luenberger observer for such a kind of systems re...
Angelo Alessandri, Paolo Coletta
ICIW
2009
IEEE
14 years 3 months ago
Paircoding: Improving File Sharing Using Sparse Network Codes
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
Christian Ortolf, Christian Schindelhauer, Arne Va...
ML
2002
ACM
167views Machine Learning» more  ML 2002»
13 years 8 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...