Sciweavers

517 search results - page 83 / 104
» Efficient Computation of Diverse Query Results
Sort
View
BMCBI
2010
116views more  BMCBI 2010»
13 years 7 months ago
FiGS: a filter-based gene selection workbench for microarray data
Background: The selection of genes that discriminate disease classes from microarray data is widely used for the identification of diagnostic biomarkers. Although various gene sel...
Taeho Hwang, Choong-Hyun Sun, Taegyun Yun, Gwan-Su...
BMCBI
2011
12 years 11 months ago
A Novel And Well-Defined Benchmarking Method For Second Generation Read Mapping
Background: Second generation sequencing technologies yield DNA sequence data at ultra high-throughput. Common to most biological applications is a mapping of the reads to an almo...
Manuel Holtgrewe, Anne-Katrin Emde, David Weese, K...
ECCV
2008
Springer
14 years 9 months ago
3D Face Model Fitting for Recognition
This paper presents an automatic efficient method to fit a statistical deformation model of the human face to 3D scan data. In a global to local fitting scheme, the shape parameter...
Frank B. ter Haar, Remco C. Veltkamp
CVPR
2003
IEEE
14 years 9 months ago
Nearest Neighbor Search for Relevance Feedback
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Jelena Tesic, B. S. Manjunath
JDA
2008
72views more  JDA 2008»
13 years 7 months ago
Semi-local longest common subsequences in subquadratic time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
Alexander Tiskin