Sciweavers

535 search results - page 27 / 107
» Do we need dependent types
Sort
View
108
Voted
ACSAC
1999
IEEE
15 years 8 months ago
Security Relevancy Analysis on the Registry of Windows NT 4.0
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...
Wenliang Du, Praerit Garg, Aditya P. Mathur
134
Voted
AAAI
2010
15 years 5 months ago
Compilation Complexity of Common Voting Rules
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...
Lirong Xia, Vincent Conitzer
123
Voted
ICDAR
2009
IEEE
15 years 10 months ago
Temporal Order Recovery of the Scanned Handwriting
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...
Abdelkarim Elbaati, Monji Kherallah, Abdellatif En...
116
Voted
ACL
2001
15 years 5 months ago
A Common Framework for Syntactic Annotation
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...
Nancy Ide, Laurent Romary
123
Voted
STOC
2006
ACM
83views Algorithms» more  STOC 2006»
16 years 3 months ago
A randomized polynomial-time simplex algorithm for linear programming
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 ...
Jonathan A. Kelner, Daniel A. Spielman