The substring traversal problem is the problem of enumerating all branching substrings appearing in a given text. Although this problem is easily solvable with the su x tree of McCreight (1976), a space e cient and practically fast solution is important. We devise a simple and e cient algorithm that simulates the traversal of the su x tree for a given text with the su x array of Manber and Meye...

It is well known that animals can use neural and sensory feedback via vision, tactile sensing, and echolocation to negotiate obstacles. Similarly, most robots use deliberate or reactive planning to avoid obstacles, which relies on prior knowledge or high-fidelity sensing of the environment. However, during dynamic locomotion in complex, novel, 3D terrains, such as a forest floor and building ru...

The traversal-based approach to execute queries over Linked Data on the WWW fetches data by traversing data links and, thus, is able to make use of up-to-date data from initially unknown data sources. While the downside of this approach is the delay before the query engine completes a query execution, user perceived response time may be improved significantly by returning as many elements of th...

In this paper, we study the maximal edge-traversal time on optimal paths in First-passage percolation lattice Zd for several edge distributions, including Pareto and Weibull distributions. It is known to be unbounded when distribution has support [J. van den Berg H. Kesten. Inequalities constant first-passage percolation. Ann. Appl. Probab. 56-80, 1993]. We determine order of growth depending t...

In previous work, we have modeled a vocabulary given as a semantic network by an OODB (Object-Oriented Database). The OODB schema thus obtained provides a compact abstract view of the vocabulary. This enables fast traversal of the vocabulary by a user. In the semantic network vocabulary, the IS-A relationships express the specialization hierarchy. In our OODB modeling of the vocabulary, the SUB...

Universal traversal sequences for cycles require length (n 1:43), improving the previous bound of (n 1:33). For d 3, universal traversal sequences for d-regular graphs require length (d 0:57 n 2:43). For constant d, the best previous bound was (n 2:33).

2.1. Computation of the hypograph of a tree along one of the dimensions of the modeling space 134 2.2. Tree traversal with regeneration of minimal nodes along the generation direction ..... 135 2.3. Computation of the epigraph of a tree along one of the directions of the modeling space 137 2.4. Tree traversal with regeneration of maximal nodes along the generation

Many applications require querying graph-structured data. As graphs grow in size, indexing becomes essential to ensure sufficient query performance. We present the GRIPP index structure (GRaph Indexing based on Preand Postorder numbering) for answering reachability and distance queries in graphs. GRIPP requires only linear space and can be computed very efficiently. Using GRIPP, we can answer r...