Sciweavers

237 search results - page 10 / 48
» Just enough tabling
Sort
View
ACISP
2003
Springer
14 years 23 days ago
Key Recovery Attacks on NTRU without Ciphertext Validation Routine
NTRU is an efficient public-key cryptosystem proposed by Hoffstein, Pipher, and Silverman. Assuming access to a decryption oracle, we show ways to recover the private key of NTRU ...
Daewan Han, Jin Hong, Jae Woo Han, Daesung Kwon
LICS
2010
IEEE
13 years 6 months ago
An Intuitionistic Logic that Proves Markov's Principle
—We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov’s principle suited for predicate lo...
Hugo Herbelin
ACL
2012
11 years 10 months ago
Specifying Viewpoint and Information Need with Affective Metaphors: A System Demonstration of the Metaphor-Magnet Web App/Servic
Metaphors pervade our language because they are elastic enough to allow a speaker to express an affective viewpoint on a topic without committing to a specific meaning. This balan...
Tony Veale, Guofu Li
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
14 years 1 months ago
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ï¬...
Filippo Geraci, Roberto Grossi
GCSE
2001
Springer
14 years 1 days ago
Reflection Support by Means of Template Metaprogramming
Abstract. The C++ language has only a limited runtime type information system, which doesn’t provide full reflection capabilities. We present a general mechanism to support refle...
Giuseppe Attardi, Antonio Cisternino