Sciweavers

19866 search results - page 87 / 3974
» Computing all factorizations in ***
Sort
View
SASP
2008
IEEE
162views Hardware» more  SASP 2008»
16 years 21 days ago
Accelerating Compute-Intensive Applications with GPUs and FPGAs
—Accelerators are special purpose processors designed to speed up compute-intensive sections of applications. Two extreme endpoints in the spectrum of possible accelerators are F...
Shuai Che, Jie Li, Jeremy W. Sheaffer, Kevin Skadr...
BMCBI
2006
145views more  BMCBI 2006»
15 years 6 months ago
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Background: Many vital biological processes, including transcription and splicing, require a combination of short, degenerate sequence patterns, or motifs, adjacent to defined seq...
Micah Hamady, Erin Peden, Rob Knight, Ravinder Sin...
COMPUTING
2000
89views more  COMPUTING 2000»
15 years 6 months ago
Condition Numbers of Approximate Schur Complements in Two- and Three-Dimensional Discretizations on Hierarchically Ordered Grids
We investigate multilevel incomplete factorizations of M-matrices arising from
J. K. Kraus, C. W. Brand
FOSSACS
2007
Springer
16 years 14 days ago
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...
Franck van Breugel, Babita Sharma, James Worrell
DLT
2009
15 years 4 months ago
Factorization Forests
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1
Mikolaj Bojanczyk