608 search results - page 52 / 122 » Tests, Proofs and Refinements |
64
Voted
ANTS
2006
Springer
15 years 2 months ago
2006
Springer
For the families ax4 = by4 +z4 +v4 +w4 , a, b = 1, . . . , 100, and ax3 = by3 + z3 + v3 + w3 , a, b = 1, . . . , 100, of projective algebraic threefolds, we test numerically the co...
ACL
1998
15 years 8 days ago
1998
We present an approach to anaphora resolution based on a focusing algorithm, and implemented within an existing MUC (Message Understanding Conference) Information Extraction syste...
EOR
2002
14 years 10 months ago
2002
We describe a general methodology, socio-cognitive engineering, for the design of human-centred technology. It integrates software, task, knowledge and organizational engineering ...
92
Voted
RANDOM
1997
Springer
15 years 3 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
STOC
2003
ACM
15 years 11 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...