Sciweavers

598 search results - page 55 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
FTTCS
2006
132views more  FTTCS 2006»
13 years 8 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
BMCBI
2005
100views more  BMCBI 2005»
13 years 8 months ago
EvDTree: structure-dependent substitution profiles based on decision tree classification of 3D environments
Background: Structure-dependent substitution matrices increase the accuracy of sequence alignments when the 3D structure of one sequence is known, and are successful e.g. in fold ...
Jean-Christophe Gelly, Laurent Chiche, Jér&...
CVPR
2001
IEEE
14 years 10 months ago
Diffusion Tensor Regularization with Constraints Preservation
This paper deals with the problem of regularizing noisy fields of diffusion tensors, considered as symmetric and semi-positive definite ? ? ? matrices (as for instance 2D structur...
David Tschumperlé, Rachid Deriche
ARC
2010
Springer
387views Hardware» more  ARC 2010»
14 years 3 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
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 8 months ago
Multigroup-Decodable STBCs from Clifford Algebras
A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximumlikelihood decoding metric can be written as a sum of g terms such that each ...
Sanjay Karmakar, B. Sundar Rajan