3653 search results - page 595 / 731 » On Recognizable Timed Languages |
177
click to vote
PEPM
1998
ACM
15 years 10 months ago
1998
ACM
Abstract. We use a code generator--type-directed partial evaluation-to verify conversions between isomorphic types, or more precisely to verify that a composite function is the ide...
157
click to vote
SPIRE
1998
Springer
15 years 10 months ago
1998
Springer
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
205
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
We present the Data Parallel Fortran (DPF) benchmark suite, a set of data parallel Fortran codes forevaluatingdata parallel compilers appropriatefor any target parallel architectu...
178
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data so...
168
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...