Sciweavers

SPATIALCOGNITION
1998
Springer
14 years 3 months ago
Spatial Representation with Aspect Maps
This paper describes the aspect map approach to model the processing of geographic maps. Geographic maps are described as spatial representation media which play an important role ...
Bettina Berendt, Thomas Barkowsky, Christian Freks...
LATIN
1998
Springer
14 years 3 months ago
Improved Approximate Pattern Matching on Hypertext
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
Gonzalo Navarro
LATIN
1998
Springer
14 years 3 months ago
The CREW PRAM Complexity of Modular Inversion
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
Joachim von zur Gathen, Igor Shparlinski
LATIN
1998
Springer
14 years 3 months ago
Shape Reconstruction with Delaunay Complex
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
Herbert Edelsbrunner
LATIN
1998
Springer
14 years 3 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro
LATIN
1998
Springer
14 years 3 months ago
Positive Varieties and Infinite Words
Carrying on the work of Arnold, P
Jean-Eric Pin
LATIN
1998
Springer
14 years 3 months ago
Spectral Techniques in Graph Algorithms
The existence of efficient algorithms to compute the eigenvectors and eigenvalues of graphs supplies a useful tool for the design of various graph algorithms. In this survey we de...
Noga Alon
LATIN
1998
Springer
14 years 3 months ago
Dynamic Packet Routing on Arrays with Bounded Buffers
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
Andrei Z. Broder, Alan M. Frieze, Eli Upfal
LATIN
1998
Springer
14 years 3 months ago
Short and Smooth Polygonal Paths
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
James Abello, Emden R. Gansner