IJFCS 2002 | Sciweavers

24

click to vote

IJFCS
2002

38views more IJFCS 2002»

Sizes of Ordered Decision Trees

13 years 11 months ago

Download www.lib.uoi.gr

Hans Zantema, Hans L. Bodlaender

claim paper

Read More »

49

click to vote

IJFCS
2002

122views more IJFCS 2002»

The Delaunay Hierarchy

13 years 11 months ago

Download hal.inria.fr

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

claim paper

Read More »

30

click to vote

IJFCS
2002

72views more IJFCS 2002»

On the Complexity of Computing Values of Restricted Games

13 years 11 months ago

Download www.esi2.us.es

Jesús Mario Bilbao, J. R. Fernández,...

claim paper

Read More »

41

click to vote

IJFCS
2002

58views more IJFCS 2002»

Vector Algorithms for Approximate String Matching

13 years 11 months ago

Download www.lacim.uqam.ca

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

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers