Sciweavers

5378 search results - page 254 / 1076
» Base Logics in Argumentation
Sort
View
SIGSOFT
2009
ACM
16 years 7 months ago
Static data race detection for concurrent programs with asynchronous calls
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threa...
Vineet Kahlon, Nishant Sinha, Erik Kruus, Yun Zhan...
TCC
2007
Springer
116views Cryptology» more  TCC 2007»
16 years 26 days ago
Long-Term Security and Universal Composability
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to a...
Jörn Müller-Quade, Dominique Unruh
APPROX
2004
Springer
125views Algorithms» more  APPROX 2004»
16 years 5 days ago
Strong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
Amin Coja-Oghlan, Andreas Goerdt, André Lan...
191
Voted
MPC
2010
Springer
147views Mathematics» more  MPC 2010»
15 years 11 months ago
Designing an Algorithmic Proof of the Two-Squares Theorem
We show a new and constructive proof of the two-squares theorem, based on a somewhat unusual, but very effective, way of rewriting the so-called extended Euclid’s algorithm. Rat...
João F. Ferreira
EMNLP
2006
15 years 8 months ago
Unsupervised Discovery of a Statistical Verb Lexicon
This paper demonstrates how unsupervised techniques can be used to learn models of deep linguistic structure. Determining the semantic roles of a verb's dependents is an impo...
Trond Grenager, Christopher D. Manning