Sciweavers

10848 search results - page 230 / 2170
» Programming in Biomolecular Computation
Sort
View
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 5 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
IJFCS
2006
91views more  IJFCS 2006»
15 years 5 months ago
Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
Heikki Hyyrö, Gonzalo Navarro
SP
2008
IEEE
115views Security Privacy» more  SP 2008»
15 years 5 months ago
Complexity in scalable computing
f abstraction (hardware) to the highest (people). This issue's theme encompasses this entire spectrum. The lead author of each article resides in the Scalable Computing Resear...
Damian W. I. Rouson
TOMS
2010
106views more  TOMS 2010»
15 years 4 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
CASES
2009
ACM
15 years 3 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis