575 search results - page 4 / 115 » A Note on Karr's Algorithm |
125
click to vote
ALGORITHMICA
1999
15 years 1 months ago
1999
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
NA
2010
14 years 11 months ago
2010
We propose a new O(n)-space implementation of the GKO-Cauchy algorithm for the solution of linear systems where the coefficient matrix is Cauchy-like. Moreover, this new algorithm...
ESA
2009
Springer
15 years 7 months ago
2009
Springer
The purpose of this brief note is to describe recent work in the area of cuckoo hashing, including a clear description of several open problems, with the hope of spurring further r...
GMP
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract. An important surface modeling problem in CAD is to connect two disjoint B-spline patches with the second-order geometric continuity. In this paper we present a study to s...
106
click to vote
IPL
2002
15 years 29 days ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...