4698 search results - page 344 / 940 » Making Functionality More General |
139
click to vote
ACL
1998
15 years 6 months ago
1998
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these att...
127
click to vote
AAAI
1997
15 years 6 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
145
Voted
ACL
1989
15 years 6 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
134
click to vote
WCE
2007
15 years 6 months ago
2007
—This paper presents the work carried out by CALPE team on the development of a mathematical model used in the study and simulation of the pantograph-catenarydynamic interaction ...
144
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Computer networks have expanded significantly in use and numbers. This expansion makes them more vulnerable to attack by malicious agents. Many current intrusion detection systems...