Sciweavers

65 search results - page 4 / 13
» birthday 2010
Sort
View
BIRTHDAY
2010
Springer
13 years 9 months ago
From Nondeterministic Suffix Automaton to Lazy Suffix Tree
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...
Kimmo Fredriksson
BIRTHDAY
2010
Springer
13 years 6 months ago
Decidable Expansions of Labelled Linear Orderings
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...
Alexis Bès, Alexander Rabinovich
BIRTHDAY
2010
Springer
13 years 6 months ago
From the Internet of Computers to the Internet of Things
Abstract. This paper1 discusses the vision, the challenges, possible usage scenarios and technological building blocks of the "Internet of Things". In particular, we cons...
Friedemann Mattern, Christian Floerkemeier
BIRTHDAY
2010
Springer
13 years 6 months ago
Distributed SQL Queries with BubbleStorm
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...
Christof Leng, Wesley W. Terpstra
BIRTHDAY
2010
Springer
13 years 1 months ago
Approximate String Matching with Reduced Alphabet
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...
Leena Salmela, Jorma Tarhio