67 search results - page 1 / 14 » Percentile Finding Algorithm for Multiple Sorted Runs |
VLDB
1989
ACM
13 years 8 months ago
1989
ACM
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
TJS
2010
12 years 11 months ago
2010
The Sort operation is a core part of many critical applications. Despite the large efforts to parallelize it, the fact that it suffers from high data-dependencies vastly limits it...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering t...
ECCC
2006
13 years 4 months ago
2006
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...