Sciweavers

314 search results - page 29 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
PKDD
2005
Springer
153views Data Mining» more  PKDD 2005»
14 years 2 months ago
A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
Marc Wörlein, Thorsten Meinl, Ingrid Fischer,...
WSC
2007
13 years 11 months ago
Simulation 101 software: workshop and beyond
The C source code associated with the Simulation 101 preconference workshop (offered at the 2006 and 2007 Winter Simulation Conferences) is presented here. This paper begins with ...
Barry Lawson, Lawrence Leemis
IPPS
2006
IEEE
14 years 2 months ago
FPGA based architecture for DNA sequence comparison and database search
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
Euripides Sotiriades, Christos Kozanitis, Apostolo...
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 8 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
BMCBI
2008
101views more  BMCBI 2008»
13 years 8 months ago
Reranking candidate gene models with cross-species comparison for improved gene prediction
Background: Most gene finders score candidate gene models with state-based methods, typically HMMs, by combining local properties (coding potential, splice donor and acceptor patt...
Qian Liu, Koby Crammer, Fernando C. N. Pereira, Da...