4315 search results - page 92 / 863 » Sorting in linear time |
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
Background: Although both conservation and correlated mutation (CM) are important information reflecting the different sorts of context in multiple sequence alignment, most of ali...
FCT
2001
Springer
14 years 1 months ago
2001
Springer
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
CAV
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interp...
ICPR
2002
IEEE
14 years 10 months ago
2002
IEEE
This paper presents and compares 3 methods for the statistical localization of partially occulted landmarks. In many real applications, some information is visible in images and s...
ASPLOS
1996
ACM
14 years 1 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...