Sciweavers

933 search results - page 181 / 187
» Fully automatic cross-associations
Sort
View
BMCBI
2006
109views more  BMCBI 2006»
14 years 11 months ago
Integrated analysis of gene expression by association rules discovery
Background: Microarray technology is generating huge amounts of data about the expression level of thousands of genes, or even whole genomes, across different experimental conditi...
Pedro Carmona-Saez, Monica Chagoyen, Andrés...
BMCBI
2006
155views more  BMCBI 2006»
14 years 11 months ago
CAVER: a new tool to explore routes from protein clefts, pockets and cavities
Background: The main aim of this study was to develop and implement an algorithm for the rapid, accurate and automated identification of paths leading from buried protein clefts, ...
Martin Petrek, Michal Otyepka, Pavel Banás,...
BMCBI
2006
94views more  BMCBI 2006»
14 years 11 months ago
Genepi: a blackboard framework for genome annotation
Background: Genome annotation can be viewed as an incremental, cooperative, data-driven, knowledge-based process that involves multiple methods to predict gene locations and struc...
Stéphane Descorps-Declère, Danielle ...
CGA
2007
14 years 11 months ago
Exploring Defocus Matting: Nonparametric Acceleration, Super-Resolution, and Off-Center Matting
Defocus matting is a fully automatic and passive method for pulling mattes from video captured with coaxial cameras that have different depths of field and planes of focus. Nonpa...
Neel Joshi, Wojciech Matusik, Shai Avidan, Hanspet...
JAIR
2006
157views more  JAIR 2006»
14 years 11 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...