Sciweavers

780 search results - page 31 / 156
» Stability of fast algorithms for structured linear systems
Sort
View
CORR
2006
Springer
95views Education» more  CORR 2006»
14 years 10 months ago
Solving Sparse Integer Linear Systems
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne...
RECOMB
2007
Springer
15 years 10 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
INFOCOM
2009
IEEE
15 years 4 months ago
Searching for Stability in Interdomain Routing
—The Border Gateway Protocol (BGP) handles the task of establishing routes between the Autonomous Systems (ASes) that make up the Internet. It is known that it is possible for a ...
Rahul Sami, Michael Schapira, Aviv Zohar
MP
2010
156views more  MP 2010»
14 years 8 months ago
Representing the space of linear programs as the Grassmann manifold
: Each linear program (LP) has an optimal basis. The space of linear programs can be partitioned according to these bases, so called the basis partition. Discovering the structures...
Gongyun Zhao
TIME
2003
IEEE
15 years 3 months ago
Hybrid Logics on Linear Structures: Expressivity and Complexity
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
Massimo Franceschet, Maarten de Rijke, Bernd-Holge...