1870 search results - page 93 / 374 » Abstract And-Parallel Machines |
CPM
2010
Springer
14 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,...
STOC
1998
ACM
14 years 1 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
14 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...
ICANN
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Capturing regularities in high-dimensional data is an important problem in machine learning and signal processing. Here we present a statistical model that learns a nonli...
EAMT
1993
14 years 1 months ago
1993
Daelemans W. Abstraction Considered Harmful: Lazy Learning of Language Processing. Proceedings of the 6th 5th Belgian-Dutch Conference on Machine Learning 1996; 3-12.