4816 search results - page 309 / 964 » Performance analysis of the AntNet algorithm |
152
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
185
click to vote
IBPRIA
2003
Springer
15 years 12 months ago
2003
Springer
This paper presents a system for 3D ultrasound which aims to reconstruct a volume of interest from a set of ultrasound images. A Bayesian reconstruction algorithm has been recently...
310
click to vote
AIPRF
2008
15 years 8 months ago
2008
Despite outstanding successes of the state-of-the-art clustering algorithms, many of them still suffer from shortcomings. Mainly, these algorithms do not capture coherency and homo...
174
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...
192
click to vote
DOCENG
2009
ACM
16 years 1 months ago
2009
ACM
In order to evaluate the performance of information retrieval and extraction algorithms, we need test collections. A test collection consists of a set of documents, a clearly form...