Sciweavers

201 search results - page 35 / 41
» Computing Hypergeometric Solutions of Linear Recurrence Equa...
Sort
View
LICS
2003
IEEE
15 years 3 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 9 months ago
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...
Sou-Cheng T. Choi, Christopher C. Paige, Michael A...
MOBIHOC
2002
ACM
15 years 9 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
DCG
2006
110views more  DCG 2006»
14 years 9 months ago
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
David L. Donoho
ICASSP
2009
IEEE
15 years 4 months ago
Robust-SL0 for stable sparse representation in noisy settings
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
Armin Eftekhari, Massoud Babaie-Zadeh, Christian J...