2342 search results - page 7 / 469 » Sublinear geometric algorithms |
78
Voted
AAAI
2007
15 years 1 months ago
2007
We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorith...
125
click to vote
APLAS
2010
ACM
14 years 10 months ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
139
click to vote
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
TC
2008
14 years 11 months ago
2008
We describe algorithms for point multiplication on Koblitz curves using multiple-base expansions of the form k = P
90
Voted
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...