Sciweavers

3145 search results - page 320 / 629
» Algebraic Linear Orderings
Sort
View
SIAMSC
2008
187views more  SIAMSC 2008»
15 years 6 months ago
The Generalized Singular Value Decomposition and the Method of Particular Solutions
A powerful method for solving planar eigenvalue problems is the Method of Particular Solutions (MPS), which is also well known under the name "point matching method". In ...
Timo Betcke
SIAMSC
2008
104views more  SIAMSC 2008»
15 years 6 months ago
Reducing Floating Point Error in Dot Product Using the Superblock Family of Algorithms
This paper discusses both the theoretical and statistical errors obtained by various well-known dot products, from the canonical to pairwise algorithms, and introduces a new and mo...
Anthony M. Castaldo, R. Clint Whaley, Anthony T. C...
RSA
2006
74views more  RSA 2006»
15 years 6 months ago
Robust locally testable codes and products of codes
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
Eli Ben-Sasson, Madhu Sudan
STTT
2008
90views more  STTT 2008»
15 years 6 months ago
A uniform framework for weighted decision diagrams and its implementation
1 This papers introduces a generic framework for OBDD variants with weighted edges. It covers many boolean and multi-valued OBDD-variants that have been studied in the literature a...
Jörn Ossowski, Christel Baier
JCB
1998
105views more  JCB 1998»
15 years 6 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou