3 search results - page 1 / 1 » Universal Guides And Finiteness And Symmetry Of Grammar Proc... |
65
Voted
COLING
1994
14 years 11 months ago
1994
This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to chara...
100
click to vote
ACL
1997
14 years 11 months ago
1997
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...
78
Voted
STOC
2002
ACM
15 years 10 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...