Sciweavers

1798 search results - page 54 / 360
» A Tree for All Seasons
Sort
View
BIRTHDAY
2010
Springer
15 years 3 months ago
From Nondeterministic Suffix Automaton to Lazy Suffix Tree
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
Kimmo Fredriksson
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
14 years 12 months ago
Restricted Walks in Regular Trees
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
Laura Ciobanu, Sasa Radomirovic
APSEC
1998
IEEE
15 years 4 months ago
An Automatic Test Case Generator Derived from State-Based Testing
This paper describes an automated approach to generating test cases for an object-oriented class. The approach is derived from state-based testing methods and refers to a state ma...
Bor-Yuan Tsai, Simon Stobart, Norman Parrington, I...
AMTA
1998
Springer
15 years 4 months ago
Making Semantic Interpretation Parser-Independent
Abstract. We present an approach to semantic interpretation of syntactically parsed Japanese sentences that works largely parser-independent. The approach relies on a standardized ...
Ulrich Germann
DM
2002
134views more  DM 2002»
14 years 11 months ago
Covering a hypergraph of subgraphs
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
Noga Alon