157 search results - page 13 / 32 » A reduction of the NF consistency problem |
ICCSA
2010
Springer
15 years 4 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
114
click to vote
IPL
2008
14 years 9 months ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
BMVC
2010
14 years 7 months ago
2010
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
SERVICES
2008
14 years 11 months ago
2008
an abstract form of service composition where Web services are represented as nondeterministic communicating automata. Considering the case in which communication is done via chan...
84
Voted
DAC
2004
ACM
15 years 10 months ago
2004
ACM
The advent of strong multi-level partitioners has made topdown min-cut placers a favored choice for modern placer implementations. We examine terminal propagation, an important st...