Sciweavers

91 search results - page 16 / 19
» combinatorics 2000
Sort
View
CPM
2000
Springer
124views Combinatorics» more  CPM 2000»
14 years 26 days ago
Indexing Text with Approximate q-Grams
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jor...
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
14 years 26 days ago
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda...
DM
2008
127views more  DM 2008»
13 years 8 months ago
An adjacency lemma for critical multigraphs
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
David Cariolaro
INFOCOM
2000
IEEE
14 years 28 days ago
Blocking in All-Optical Networks
— We present a new analytical technique, based on the inclusion–exclusion principle from combinatorics, for the analysis of all-optical networks with no wavelength conversion a...
Ashwin Sridharan, Kumar N. Sivarajan
SIAMJO
2000
86views more  SIAMJO 2000»
13 years 8 months ago
On the SQAP-Polytope
The SQAP-polytope was associated to quadratic assignment problems with a certain symmetric objective function structure by Rijal (1995) and Padberg and Rijal (1996). We derive a te...
Michael Jünger, Volker Kaibel