926 search results - page 20 / 186 » Pulp-based computing: a framework for building computers out... |
COLING
1996
13 years 9 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
PDCAT
2007
Springer
14 years 1 months ago
2007
Springer
—Grid system software is inherently complex, hard to build and maintain. In this paper, we propose a selfmanaging building block: Grid Unit, which facilitates constructing Grid s...
NDSS
2000
IEEE
14 years 1 days ago
2000
IEEE
Traditional Intrusion Detection Systems (IDSs) mostly work off-line, without any direct runtime interaction or coordination with the applications (and with other IDSs) that they a...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...