91 search results - page 16 / 19 » Regular Expressions for Languages over Infinite Alphabets |
81
Voted
SIGIR
1998
ACM
15 years 2 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
CCS
2007
ACM
15 years 4 months ago
2007
ACM
Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and...
110
Voted
CIKM
2008
Springer
15 years 6 days ago
2008
Springer
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
84
Voted
CONCUR
2004
Springer
15 years 3 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
75
Voted
ICDT
2003
ACM
15 years 3 months ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...