Sciweavers

4302 search results - page 681 / 861
» Index Pairs Algorithms
Sort
View
TCBB
2008
103views more  TCBB 2008»
13 years 9 months ago
DNA Motif Representation with Nucleotide Dependency
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
Francis Y. L. Chin, Henry C. M. Leung
TCSB
2008
13 years 9 months ago
Clustering Time-Series Gene Expression Data with Unequal Time Intervals
Clustering gene expression data given in terms of time-series is a challenging problem that imposes its own particular constraints, namely exchanging two or more time points is not...
Luis Rueda, Ataul Bari, Alioune Ngom
TIT
2008
102views more  TIT 2008»
13 years 9 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
VC
2008
143views more  VC 2008»
13 years 9 months ago
A single-pass GPU ray casting framework for interactive out-of-core rendering of massive volumetric datasets
We present an adaptive out-of-core technique for rendering massive scalar volumes employing single pass GPU raycasting. The method is based on the decomposition of a volumetric dat...
Enrico Gobbetti, Fabio Marton, José Antonio...
CORR
2002
Springer
121views Education» more  CORR 2002»
13 years 9 months ago
Answering Subcognitive Turing Test Questions: A Reply to French
Robert French has argued that a disembodied computer is incapable of passing a Turing Test that includes subcognitive questions. Subcognitive questions are designed to probe the n...
Peter D. Turney