Sciweavers

573 search results - page 54 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
CGF
2010
113views more  CGF 2010»
13 years 9 months ago
Signing the Unsigned: Robust Surface Reconstruction from Raw Pointsets
We propose a modular framework for robust 3D reconstruction from unorganized, unoriented, noisy, and outlierridden geometric data. We gain robustness and scalability over previous...
Patrick Mullen, Fernando de Goes, Mathieu Desbrun,...
ICASSP
2011
IEEE
13 years 25 days ago
Cosparse analysis modeling - uniqueness and algorithms
In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of i...
Sangnam Nam, Michael E. Davies, Michael Elad, R&ea...
BMCBI
2007
144views more  BMCBI 2007»
13 years 9 months ago
Assessing the ability of sequence-based methods to provide functional insight within membrane integral proteins: a case study an
Background: Efforts to predict functional sites from globular proteins is increasingly common; however, the most successful of these methods generally require structural insight. ...
Dennis R. Livesay, Patrick D. Kidd, Sepehr Eskanda...
ASIACRYPT
2005
Springer
14 years 2 months ago
An Analysis of the XSL Algorithm
The XSL “algorithm” is a method for solving systems of multivariate polynomial equations based on the linearization method. It was proposed in 2002 as a dedicated method for ex...
Carlos Cid, Gaëtan Leurent
ARC
2010
Springer
387views Hardware» more  ARC 2010»
14 years 4 months ago
Optimising Memory Bandwidth Use for Matrix-Vector Multiplication in Iterative Methods
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community [1–3]...
David Boland, George A. Constantinides