Sciweavers

575 search results - page 4 / 115
» A Note on Karr's Algorithm
Sort
View
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 7 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
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...
Luc Devroye
NA
2010
87views more  NA 2010»
13 years 5 months ago
A note on the O(n)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
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...
Federico Poloni
ESA
2009
Springer
94views Algorithms» more  ESA 2009»
14 years 1 months ago
Some Open Questions Related to Cuckoo Hashing
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...
Michael Mitzenmacher
GMP
2008
IEEE
113views Solid Modeling» more  GMP 2008»
14 years 1 months ago
Note on Industrial Applications of Hu's Surface Extension Algorithm
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...
Yu Zang, Yong-Jin Liu, Yu-Kun Lai
IPL
2002
125views more  IPL 2002»
13 years 7 months ago
A note concerning the closest point pair algorithm
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...
Martin Richards