3724 search results - page 82 / 745 » Timed regular expressions |
215
Voted
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
151
click to vote
IANDC
2007
15 years 3 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
142
click to vote
IDEAL
2004
Springer
15 years 9 months ago
2004
Springer
Microarray datasets are often too large to visualise due to the high dimensionality. The self-organising map has been found useful to analyse massive complex datasets. It can be us...
146
Voted
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
126
click to vote
DLT
2003
15 years 5 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...