Sciweavers

523 search results - page 12 / 105
» Decidability of string graphs
Sort
View
COMBINATORICS
2007
77views more  COMBINATORICS 2007»
14 years 9 months ago
On the Genus Distribution of (p, q, n)-Dipoles
There are many applications of the enumeration of maps in surfaces to other areas of mathematics and the physical sciences. In particular, in quantum field theory and string theo...
Terry I. Visentin, Susana W. Wieler
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
15 years 1 months ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
15 years 9 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
APLAS
2006
ACM
15 years 3 months ago
XML Validation for Context-Free Grammars
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
Yasuhiko Minamide, Akihiko Tozawa
CNSR
2004
IEEE
124views Communications» more  CNSR 2004»
15 years 1 months ago
Adaptive Filtering of SPAM
In this paper, we present a new spam filter which acts as an additional layer in the spam filtering process. This filter is based on what we call a representative vocabulary. Spam...
L. Pelletier, Jalal Almhana, Vartan Choulakian