6315 search results - page 1247 / 1263 » Approximating Solution Structure |
141
click to vote
PDPTA
2000
15 years 3 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
106
click to vote
ANLP
1994
15 years 3 months ago
1994
The use of NLP techniques for document classification has not produced significant improvements in performance within the standard term weighting statistical assignment paradigm (...
120
Voted
COLING
1996
15 years 3 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...
112
click to vote
ANLP
1992
15 years 3 months ago
1992
This paper describes an approach to the treatment of nominal compounds in a machine translation project employing a modern unification-based system. General problems connected wit...
127
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...