591 search results - page 43 / 119 » Implementing Joins Using Extensible Pattern Matching |
COORDINATION
2008
Springer
14 years 11 months ago
2008
Springer
Recently, specific attention has been devoted to the development of service oriented process calculi. Besides the foundational aspects, it is also interesting to have prototype imp...
102
click to vote
JTAER
2010
14 years 8 months ago
2010
Design patterns, acting as recurring solutions to common problems, offer significant benefits such as avoiding unnecessary complexity, and promoting code reuse, maintainability an...
SPIRE
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
69
Voted
WEA
2007
Springer
15 years 3 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
CPM
1999
Springer
15 years 1 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...