1615 search results - page 209 / 323 » Computer science and decision theory |
174
click to vote
STACS
1994
Springer
15 years 11 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
155
click to vote
ACMSE
1990
ACM
15 years 11 months ago
1990
ACM
Current research in natural language processing is characterized by the development of theories of grammar which strongly depend on the lexicon to drive parsing systems (e.g. Lexi...
181
click to vote
AVI
2008
15 years 8 months ago
2008
Programming assignments are easy to plagiarize in such a way as to foil casual reading by graders. Graders can resort to automatic plagiarism detection systems, which can generate...
178
click to vote
CAD
2002
Springer
15 years 6 months ago
2002
Springer
This paper describes the theory and implementation of a discrete mechanics model for deformable bodies, incorporating behavior such as motion, collision, deformation etc. The mode...
188
click to vote
TCS
2011
15 years 1 months ago
2011
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n + 2)-nomial with a constant term, allowing real exponents as well as real...