Sciweavers

573 search results - page 23 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
ICML
2010
IEEE
13 years 10 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 4 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
UIST
1997
ACM
14 years 1 months ago
Solving Linear Arithmetic Constraints for User Interface Applications
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring th...
Alan Borning, Kim Marriott, Peter J. Stuckey, Yi X...
RC
2002
100views more  RC 2002»
13 years 8 months ago
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
Chong-Kan Chiu, Jimmy Ho-Man Lee
ICASSP
2011
IEEE
13 years 22 days ago
Recovery of sparse perturbations in Least Squares problems
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structure...
Mert Pilanci, Orhan Arikan