1892 search results - page 86 / 379 » Warren's Abstract Machine |
CEFP
2005
Springer
15 years 3 months ago
2005
Springer
This chapter describes Hume: a functionally-based language for programming with bounded resource usage, including time and space properties. The purpose of the Hume language design...
CPM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text,...
106
click to vote
STOC
1998
ACM
15 years 2 months ago
1998
ACM
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
MFCS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
IMCSIT
2010
14 years 7 months ago
2010
Abstract--We present a method for improving existing statistical machine translation methods using an knowledge-base compiled from a bilingual corpus as well as sequence alignment ...