Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
Let M = (A, <, P) where (A, <) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type or -, an...
Abstract. This paper1 discusses the vision, the challenges, possible usage scenarios and technological building blocks of the "Internet of Things". In particular, we cons...
Abstract. Current peer-to-peer (p2p) systems place the burden of application-level query execution on the application developer. Not only do application developers lack the experti...
Abstract. We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet. We apply the alphabet reduction scheme to a tuned versi...