Sciweavers

888 search results - page 36 / 178
» The Power of Temporal Proofs
Sort
View
SLP
1993
110views more  SLP 1993»
14 years 11 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
TIT
2010
121views Education» more  TIT 2010»
14 years 4 months ago
Power of a public random permutation and its application to authenticated encryption
In this paper, we first show that many independent pseudorandom permutations over {0, 1}n can be obtained from a single public random permutation and secret n bits. We next prove ...
Kaoru Kurosawa
ACIVS
2005
Springer
15 years 3 months ago
Scene-Cut Processing in Motion-Compensated Temporal Filtering
Motion-compensated temporal filtering (MCTF) is a powerful technique entering scalable video coding schemes. Its performance decreases significantly however if the the video sig...
Maria Trocan, Béatrice Pesquet-Popescu
JISBD
2003
14 years 11 months ago
Using Contextual Logic Programming for Temporal Reasoning
The importance of temporal representation and reasoning is well known to the database community. Examples of such significance are the languages TSQL2 and its follow up, SQL/Tempo...
Vítor Nogueira, Salvador Abreu, Gabriel Dav...
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
15 years 7 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi