Sciweavers

485 search results - page 30 / 97
» Unconstraint Assignment Problem: A Molecular Computing Appro...
Sort
View
IJCV
1998
233views more  IJCV 1998»
13 years 7 months ago
A Level-Set Approach to 3D Reconstruction from Range Data
This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a stati...
Ross T. Whitaker
ALMOB
2008
131views more  ALMOB 2008»
13 years 7 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
KSEM
2007
Springer
14 years 1 months ago
A Merging-Based Approach to Handling Inconsistency in Locally Prioritized Software Requirements
Abstract. It has been widely recognized that the relative priority of requirements can help developers to resolve inconsistencies and make some necessary trade-off decisions. Howe...
Kedian Mu, Weiru Liu, Zhi Jin, Ruqian Lu, Anbu Yue...
WOB
2004
134views Bioinformatics» more  WOB 2004»
13 years 9 months ago
Reconstruction of Phylogenetic Trees using the Ant Colony Optimization Paradigm
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
Heitor S. Lopes, Mauricio Perretto
PG
2007
IEEE
14 years 1 months ago
Contour Correspondence via Ant Colony Optimization
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
Oliver van Kaick, Ghassan Hamarneh, Hao Zhang 0002...