Sciweavers

1068 search results - page 204 / 214
» Extremely randomized trees
Sort
View
BMCBI
2008
128views more  BMCBI 2008»
13 years 7 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»
13 years 7 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»
13 years 7 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
11 years 10 months 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 eļ¬ƒcient spectrum sharing mecha...
Xu Chen, Jianwei Huang
CVPR
2012
IEEE
11 years 10 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random ļ¬eld (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr