Sciweavers

915 search results - page 183 / 183
» Proof labeling schemes
Sort
View
CCS
2008
ACM
13 years 9 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
13 years 8 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...
BIODATAMINING
2008
117views more  BIODATAMINING 2008»
13 years 7 months ago
Search extension transforms Wiki into a relational system: A case for flavonoid metabolite database
Background: In computer science, database systems are based on the relational model founded by Edgar Codd in 1970. On the other hand, in the area of biology the word 'databas...
Masanori Arita, Kazuhiro Suwa
SYNTHESE
2008
99views more  SYNTHESE 2008»
13 years 6 months ago
Public and private communication are different: results on relative expressivity
Dynamic Epistemic Logic (DEL) is the study of how to reason about knowledge, belief, and communication. This paper studies the relative expressivity of certain fragments of the DE...
Bryan Renne