Sciweavers

IJFCS
2002
38views more  IJFCS 2002»
14 years 7 days ago
Sizes of Ordered Decision Trees
Hans Zantema, Hans L. Bodlaender
IJFCS
2002
122views more  IJFCS 2002»
14 years 7 days ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers
IJFCS
2002
72views more  IJFCS 2002»
14 years 7 days ago
On the Complexity of Computing Values of Restricted Games
Jesús Mario Bilbao, J. R. Fernández,...
IJFCS
2002
58views more  IJFCS 2002»
14 years 7 days ago
Vector Algorithms for Approximate String Matching
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
Anne Bergeron, Sylvie Hamel