Sciweavers

1679 search results - page 278 / 336
» Evaluation by comparing result sets in context
Sort
View
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
13 years 11 months ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström
BMCBI
2006
106views more  BMCBI 2006»
13 years 7 months ago
Methodological study of affine transformations of gene expression data with proposed robust non-parametric multi-dimensional nor
Background: Low-level processing and normalization of microarray data are most important steps in microarray analysis, which have profound impact on downstream analysis. Multiple ...
Henrik Bengtsson, Ola Hössjer
BMCBI
2006
239views more  BMCBI 2006»
13 years 7 months ago
Applying dynamic Bayesian networks to perturbed gene expression data
Background: A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics,...
Norbert Dojer, Anna Gambin, Andrzej Mizera, Bartek...
BMCBI
2010
143views more  BMCBI 2010»
13 years 5 months ago
A genome alignment algorithm based on compression
Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison
CVPR
2005
IEEE
14 years 9 months ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas