Sciweavers

180 search results - page 22 / 36
» Towards an implementable dependency grammar
Sort
View
ANLP
1997
106views more  ANLP 1997»
13 years 9 months ago
Incremental Finite-State Parsing
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
Salah Ait-Mokhtar, Jean-Pierre Chanod
SOUPS
2006
ACM
14 years 2 months ago
An empirical study of natural language parsing of privacy policy rules using the SPARCLE policy workbench
Today organizations do not have good ways of linking their written privacy policies with the implementation of those policies. To assist organizations in addressing this issue, ou...
Carolyn Brodie, Clare-Marie Karat, John Karat
PLDI
2006
ACM
14 years 2 months ago
An experimental analysis of self-adjusting computation
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kan...
ASPLOS
1992
ACM
14 years 17 days ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
BCS
2008
13 years 10 months ago
Tools for Traceable Security Verification
Dependable systems evolution has been identified by the UK Computing Research Committee (UKCRC) as one of the current grand challenges for computer science. We present work toward...
Jan Jürjens, Yijun Yu, Andreas Bauer 0002