Sciweavers

697 search results - page 99 / 140
» Improving EAs for Sequencing Problems
Sort
View
BCB
2010
156views Bioinformatics» more  BCB 2010»
13 years 4 months ago
RepFrag: a graph based method for finding repeats and transposons from fragmented genomes
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
Nirmalya Bandyopadhyay, A. Mark Settles, Tamer Kah...
BIRTHDAY
2010
Springer
14 years 2 months ago
Indexing and Searching a Mass Spectrometry Database
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...
Søren Besenbacher, Benno Schwikowski, Jens ...
IJCGA
1998
74views more  IJCGA 1998»
13 years 9 months ago
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukaw...
ICCV
2009
IEEE
1957views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Robust Visual Tracking using L1 Minimization
In this paper we propose a robust visual tracking method by casting tracking as a sparse approximation problem in a particle filter framework. In this framework, occlusion, corru...
Xue Mei, Haibin Ling
CVPR
2005
IEEE
14 years 11 months ago
Complex 3D Shape Recovery Using a Dual-Space Approach
This paper presents a novel method for reconstructing complex 3D objects with unknown topology using silhouettes extracted from image sequences. This method exploits the duality p...
Chen Liang, Kwan-Yee Kenneth Wong