Sciweavers

3466 search results - page 139 / 694
» Fast computation of special resultants
Sort
View
DAC
2005
ACM
15 years 8 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
15 years 8 months ago
Fast Multilevel Transduction on Graphs
The recent years have witnessed a surge of interest in graphbased semi-supervised learning methods. The common denominator of these methods is that the data are represented by the...
Fei Wang, Changshui Zhang
BMCBI
2006
129views more  BMCBI 2006»
15 years 6 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
CSDA
2006
98views more  CSDA 2006»
15 years 6 months ago
Fast estimation algorithm for likelihood-based analysis of repeated categorical responses
Likelihood-based marginal regression modelling for repeated, or otherwise clustered, categorical responses is computationally demanding. This is because the number of measures nee...
Jukka Jokinen
JCB
2007
168views more  JCB 2007»
15 years 6 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang