CIBCB
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract— In this paper, we study the use of cooperation as a technique for designing faster algorithms for reconstructing phylogenetic trees. Our focus is on the use of cooperat...
CIBCB
2005
IEEE
14 years 3 months ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
CEC
2005
IEEE
14 years 3 months ago
2005
IEEE
Despite the existence of a number of procedures for real-parameter optimization using evolutionary algorithms, there is still a need of a systematic and unbiased comparison of di...
CCGRID
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper focuses on the scheduling of multiple-wavelength lightpaths and outlines an algorithm to provide increased simultaneous allocations of lightpaths on the Lambda-Grid. Se...
CAMP
2005
IEEE
14 years 3 months ago
2005
IEEE
— In this paper we describe a two step algorithm which localizes faces in 2D color images depicting a single face on a complex background. Given a single image, the algorithm rou...
BIBE
2005
IEEE
14 years 3 months ago
2005
IEEE
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 ...
ARITH
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract— A hardware algorithm for integer division is proposed. It is based on the digit-recurrence, non-restoring division algorithm. Fast computation is achieved by the use of...
AICT
2005
IEEE
14 years 3 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
UIST
2006
ACM
14 years 3 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
SMA
2006
ACM
14 years 3 months ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...