Sciweavers

336 search results - page 63 / 68
» Program Speedups in Theory and Practice
Sort
View
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 8 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
ICFP
2006
ACM
14 years 7 months ago
Delimited dynamic binding
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
14 years 29 days ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
BIRTHDAY
2010
Springer
13 years 8 months ago
Inferring Loop Invariants Using Postconditions
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
Carlo A. Furia, Bertrand Meyer
DLOG
2008
13 years 9 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer