Sciweavers

97 search results - page 19 / 20
» Properties of codes in rank metric
Sort
View
SIGSOFT
2007
ACM
14 years 7 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
BMCBI
2010
164views more  BMCBI 2010»
13 years 4 months ago
Merged consensus clustering to assess and improve class discovery with microarray data
Background: One of the most commonly performed tasks when analysing high throughput gene expression data is to use clustering methods to classify the data into groups. There are a...
T. Ian Simpson, J. Douglas Armstrong, Andrew P. Ja...
BMCBI
2010
130views more  BMCBI 2010»
13 years 7 months ago
Amino acid "little Big Bang": Representing amino acid substitution matrices as dot products of Euclidian vectors
Background: Sequence comparisons make use of a one-letter representation for amino acids, the necessary quantitative information being supplied by the substitution matrices. This ...
Karel Zimmermann, Jean-François Gibrat
BMCBI
2008
101views more  BMCBI 2008»
13 years 7 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...
PAMI
2006
229views more  PAMI 2006»
13 years 6 months ago
A Coherent Computational Approach to Model Bottom-Up Visual Attention
Visual attention is a mechanism which filters out redundant visual information and detects the most relevant parts of our visual field. Automatic determination of the most visually...
Olivier Le Meur, Patrick Le Callet, Dominique Barb...