1728 search results - page 191 / 346 » The Accelerated Euclidean Algorithm |
138
click to vote
SIAMSC
2008
15 years 3 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
272
click to vote
GECCO
2011
Springer
14 years 6 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
138
Voted
ICIP
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper, we propose a series of techniques to enhance the computational performance of existing Belief Propagation (BP) based stereo matching that relies on automatic estima...
128
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
In genomic sequence analysis tasks like splice site recognition or promoter identification, large amounts of training sequences are available, and indeed needed to achieve suffici...
126
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
Computing large multiple protein sequence alignments using progressive alignment tools such as ClustalW requires several hours on state-of-the-art workstations. ClustalW uses a th...