134 search results - page 9 / 27 » A Boyer-Moore Type Algorithm for Compressed Pattern Matching |
TPHOL
2003
IEEE
14 years 3 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
DCC
2007
IEEE
14 years 10 months ago
2007
IEEE
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
ICDE
2011
IEEE
13 years 2 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
POPL
2009
ACM
14 years 11 months ago
2009
ACM
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
ICIP
1999
IEEE
14 years 12 months ago
1999
IEEE
We present a new image compression technique called DjVu" that is speci cally geared towards the compression of scanned documents in color at high resolution. With DjVu, a ma...