SOFSEM
2007
Springer
14 years 6 months ago
2007
Springer
SOFSEM
2007
Springer
14 years 6 months ago
2007
Springer
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
SOFSEM
2007
Springer
14 years 6 months ago
2007
Springer
Indexing of factors is a widely used and useful technique in stringology and can be seen as a tool in solving diverse text algorithmic problems. A gapped-factor is a concatenation ...
SOFSEM
2007
Springer
14 years 6 months ago
2007
Springer
SOFSEM
2007
Springer
14 years 6 months ago
2007
Springer
Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, ca...
SOFSEM
2007
Springer
14 years 6 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
SOFSEM
2007
Springer
14 years 6 months ago
2007
Springer
SOFSEM
2007
Springer
14 years 6 months ago
2007
Springer
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...
SOFSEM
2007
Springer
14 years 6 months ago
2007
Springer
SOFSEM
2007
Springer
14 years 6 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...