535 search results - page 27 / 107 » Do we need dependent types |
ACSAC
1999
IEEE
14 years 2 days ago
1999
IEEE
Many security breaches are caused by inappropriate inputs crafted by people with malicious intents. To enhance the system security, we need either to ensure that inappropriate inp...
AAAI
2010
13 years 9 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
ICDAR
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we present a new approach to the temporal order restoration of the off-line handwriting. After the preprocessing steps of the word image, a suitable algorithm makes...
ACL
2001
13 years 9 months ago
2001
It is widely recognized that the proliferation of annotation schemes runs counter to the need to re-use language resources, and that standards for linguistic annotation are becomi...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...