Results 1  10
of
2,368
OnLine Construction of Suffix Trees
, 1995
"... An online algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part of the strin ..."
Abstract

Cited by 437 (2 self)
 Add to MetaCart
An online algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part
Collaborative Authoring for OnLine Construction Curricula
"... This work is part of a regional initiative to build training and employment services into a career pathways system for the green building industry sector, with a particular focus on construction and retrofitting towards more energyefficient buildings, and installation of alternative energy systems. ..."
Abstract
 Add to MetaCart
This work is part of a regional initiative to build training and employment services into a career pathways system for the green building industry sector, with a particular focus on construction and retrofitting towards more energyefficient buildings, and installation of alternative energy systems
Online Construction of compact suffix vectors and maximal repeats ∗
"... A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear construction algorithm of an extended suffix vector then another linear algorithm to transform an extended suffix vector into a ..."
Abstract
 Add to MetaCart
more space economical compact suffix vector. We propose an online linear algorithm for directly constructing a compact suffix vector. Not only we show that it is possible to directly build a compact suffix vector but we will also show that this online construction can be faster than the construction
Online construction of the convex hull of a simple polygon
 Information Processing Letters
, 1987
"... 1. Introduction and description of the algorithm After McCallum and Avis [4] showed that the convex hull of a simple polygon P with n vertices can be constructed in O(n) time, several authors [1,2,3] devised simplified algorithms for this prob ..."
Abstract

Cited by 63 (0 self)
 Add to MetaCart
1. Introduction and description of the algorithm After McCallum and Avis [4] showed that the convex hull of a simple polygon P with n vertices can be constructed in O(n) time, several authors [1,2,3] devised simplified algorithms for this prob
Online construction of compact directed acyclic word graphs.
 In Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM’01), volume 2089 of Lecture Notes in Computer Science,
, 2001
"... Abstract Many different index structures, providing efficient solutions to problems related to pattern matching, have been introduced so far. Examples of these structures are suffix trees and directed acyclic word graphs (DAWGs), which can be efficiently constructed in linear time and space. Compac ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
Creight's algorithm for constructing suffix trees. In this work, we present a novel online lineartime algorithm that builds the CDAWG for a single string as well as for a set of strings, inspired by Ukkonen's online algorithm for constructing suffix trees.
OnLine Construction of Symmetric Compact Directed Acyclic Word Graphs
 In Proc. of 8th International Symposium on String Processing and Information Retrieval (SPIRE’01
, 2001
"... The Compact Directed Acyclic Word Graph (CDAWG) is a space efficient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph (SCDAWG) for a string w is a dual structure that supports indices of both w and the reverse of w simultaneously. Blumer et al. gave the fir ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
the first algorithm to construct an SCDAWG from a given string, that works in an offline manner. In this paper, we show an online algorithm that constructs an SCDAWG from a given string directly.
An online constructive heuristic to optimise the hybrid pick and place machine
 SCHOOL OF CSIT, THE UNIVERSTIY OF NOTTINGHAM
, 2005
"... ..."
International Journal of Foundations of Computer Science c © World Scientific Publishing Company Online construction of a small automaton for a finite set of words
, 2010
"... In this paper we describe a “light ” algorithm for the online construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of ..."
Abstract
 Add to MetaCart
In this paper we describe a “light ” algorithm for the online construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors
ONLINE CONSTRUCTION AND RULE BASE SIMPLIFICATION BY REPLACEMENT IN FUZZY SYSTEMS APPLIED TO A WASTEWATER TREATMENT PLANT
"... Abstract: Evolving TakagiSugeno (eTS) fuzzy models are used to build a computational model for the WasteWater Treatment Plant (WWTP) in a paper mill. The fuzzy rule base is constructed online from data using a recursive fuzzy clustering algorithm that develops the model structure and parameters. I ..."
Abstract
 Add to MetaCart
Abstract: Evolving TakagiSugeno (eTS) fuzzy models are used to build a computational model for the WasteWater Treatment Plant (WWTP) in a paper mill. The fuzzy rule base is constructed online from data using a recursive fuzzy clustering algorithm that develops the model structure and parameters
Results 1  10
of
2,368