Sciweavers

324 search results - page 45 / 65
» Guessing based on length functions
Sort
View
JAIR
2007
107views more  JAIR 2007»
13 years 7 months ago
Compressed Pattern Databases
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct...
Ariel Felner, Richard E. Korf, Ram Meshulam, Rober...
DEXA
2008
Springer
123views Database» more  DEXA 2008»
13 years 9 months ago
Evolutionary Clustering in Description Logics: Controlling Concept Formation and Drift in Ontologies
Abstract. We present a method based on clustering techniques to detect concept drift or novelty in a knowledge base expressed in Description Logics. The method exploits an effectiv...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
CRYPTO
2011
Springer
243views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Memory Delegation
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ra...
DAC
2003
ACM
14 years 8 months ago
A scalable software-based self-test methodology for programmable processors
Software-based self-test (SBST) is an emerging approach to address the challenges of high-quality, at-speed test for complex programmable processors and systems-on chips (SoCs) th...
Li Chen, Srivaths Ravi, Anand Raghunathan, Sujit D...
ACNS
2009
Springer
193views Cryptology» more  ACNS 2009»
14 years 2 months ago
Cryptanalysis of Twister
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
Florian Mendel, Christian Rechberger, Martin Schl&...