Sciweavers

6618 search results - page 1112 / 1324
» Natural Logic for Natural Language
Sort
View
ACL
1997
15 years 8 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
186
Voted
INTERNET
2008
150views more  INTERNET 2008»
15 years 6 months ago
RPC and REST: Dilemma, Disruption, and Displacement
straction and explained how the Representational State Transfer (REST) architectural style is one alternative that can yield a superior approach to building distributed systems. Be...
Steve Vinoski
SIAMDM
1998
89views more  SIAMDM 1998»
15 years 6 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky
CSFW
2011
IEEE
14 years 6 months ago
Local Memory via Layout Randomization
—Randomization is used in computer security as a tool to introduce unpredictability into the software infrastructure. In this paper, we study the use of randomization to achieve ...
Radha Jagadeesan, Corin Pitcher, Julian Rathke, Ja...
AGP
1995
IEEE
15 years 10 months ago
A Prolog Implementation of Kem
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
Alberto Artosi, Paola Cattabriga, Guido Governator...
« Prev « First page 1112 / 1324 Last » Next »