1215 search results - page 131 / 243 » Combinatorics |
177
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
El-Yaniv et al. presented an optimal on-line algorithm for the unidirectional currency conversion problem based on the threat-based strategy. Later, al-Binali pointed out that this...
160
click to vote
CPM
2009
Springer
15 years 10 months ago
2009
Springer
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
158
click to vote
COCOON
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if ...
151
click to vote
COCOC
1995
15 years 10 months ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
149
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
d Abstract] Luca Allulli, Giorgio Ausiello, and Luigi Laura Dip. di Informatica e Sistemistica Universit`a di Roma “La Sapienza” Via Salaria, 113 - 00198 Roma Italy.