523 search results - page 88 / 105 » Decidability of string graphs |
107
click to vote
ESA
2011
Springer
13 years 9 months ago
2011
Springer
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
ALT
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
ECAI
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
DLT
2007
14 years 11 months ago
2007
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...