1146 search results - page 122 / 230 » Finite cupping sets |
162
click to vote
CSL
2008
Springer
15 years 6 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
142
click to vote
FPL
2008
Springer
15 years 5 months ago
2008
Springer
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
133
click to vote
FORTE
2004
15 years 5 months ago
2004
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
153
click to vote
NC
1998
15 years 5 months ago
1998
This paper reports the results of experiments in complex Arabic phonetic features identification using a rulebased system (SARPH) and modular connectionist architectures. The firs...
132
click to vote
JSAC
2008
15 years 4 months ago
2008
Given an arbitrary network of interconnected nodes, we develop and analyze a distributed strategy that enables a subset of the nodes to calculate any given function of the node val...