2342 search results - page 7 / 469 » Sublinear geometric algorithms |
AAAI
2007
13 years 10 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...
APLAS
2010
ACM
13 years 6 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...
ICALP
2001
Springer
14 years 1 days 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
13 years 7 months ago
2008
We describe algorithms for point multiplication on Koblitz curves using multiple-base expansions of the form k = P
ICALP
2004
Springer
14 years 28 days 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...