Sciweavers

1060 search results - page 202 / 212
» On the Discovery of Random Trees
Sort
View
ADAEUROPE
2003
Springer
15 years 3 months ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney
BMCBI
2008
128views more  BMCBI 2008»
14 years 10 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
BMCBI
2008
114views more  BMCBI 2008»
14 years 10 months ago
Dinucleotide controlled null models for comparative RNA gene prediction
Background: Comparative prediction of RNA structures can be used to identify functional noncoding RNAs in genomic screens. It was shown recently by Babak et al. [BMC Bioinformatic...
Tanja Gesell, Stefan Washietl
JAIR
2007
132views more  JAIR 2007»
14 years 9 months ago
New Inference Rules for Max-SAT
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpli...
Chu Min Li, Felip Manyà, Jordi Planes
MOBIHOC
2012
ACM
13 years 9 days ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang