Sciweavers

1652 search results - page 318 / 331
» Matching Vector Codes
Sort
View
BMCBI
2005
153views more  BMCBI 2005»
14 years 11 months ago
A comparative review of estimates of the proportion unchanged genes and the false discovery rate
Background: In the analysis of microarray data one generally produces a vector of p-values that for each gene give the likelihood of obtaining equally strong evidence of change by...
Per Broberg
TMM
2008
167views more  TMM 2008»
14 years 11 months ago
Mining Appearance Models Directly From Compressed Video
In this paper, we propose an approach to learning appearance models of moving objects directly from compressed video. The appearance of a moving object changes dynamically in vide...
Datong Chen, Qiang Liu, Mingui Sun, Jie Yang
105
Voted
BMCBI
2004
140views more  BMCBI 2004»
14 years 11 months ago
What can we learn from noncoding regions of similarity between genomes?
Background: In addition to known protein-coding genes, large amounts of apparently non-coding sequence are conserved between the human and mouse genomes. It seems reasonable to as...
Thomas A. Down, Tim J. P. Hubbard
BMCBI
2004
156views more  BMCBI 2004»
14 years 11 months ago
GeneXplorer: an interactive web application for microarray data visualization and analysis
Background: When publishing large-scale microarray datasets, it is of great value to create supplemental websites where either the full data, or selected subsets corresponding to ...
Christian A. Rees, Janos Demeter, John C. Matese, ...
TIT
1998
90views more  TIT 1998»
14 years 10 months ago
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
Amir H. Banihashemi, Amir K. Khandani