Sciweavers

38 search results - page 7 / 8
» Improving Search Results Quality by Customizing Summary Leng...
Sort
View
GECCO
2000
Springer
250views Optimization» more  GECCO 2000»
13 years 9 months ago
A Simple and Fast GA-SA hybrid Image Segmentation Algorithm
Image segmentation is an important process of image analysis. Most of the published approaches for image segmentation need to set appropriate parameter values to cope with the unc...
Shinn-Ying Ho, Kual-Zheng Lee
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
13 years 11 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
BMCBI
2008
101views more  BMCBI 2008»
13 years 5 months ago
Scipio: Using protein sequences to determine the precise exon/intron structures of genes and their orthologs in closely related
Background: For many types of analyses, data about gene structure and locations of non-coding regions of genes are required. Although a vast amount of genomic sequence data is ava...
Oliver Keller, Florian Odronitz, Mario Stanke, Mar...
COR
2007
163views more  COR 2007»
13 years 5 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 2 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young