Sciweavers

236 search results - page 12 / 48
» From Weak to Strong Watermarking
Sort
View
PRL
2008
213views more  PRL 2008»
13 years 9 months ago
Boosting recombined weak classifiers
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...
Juan José Rodríguez, Jesús Ma...
ICDCS
2008
IEEE
14 years 4 months ago
Weak vs. Self vs. Probabilistic Stabilization
Self-stabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later bee...
Stéphane Devismes, Sébastien Tixeuil...
ACISP
2007
Springer
14 years 4 months ago
Hash-and-Sign with Weak Hashing Made Secure
Abstract. Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a ...
Sylvain Pasini, Serge Vaudenay
WETICE
2006
IEEE
14 years 3 months ago
Co-Presence Communities: Using Pervasive Computing to Support Weak Social Networks
Although the strongest social relationships feature most prominently in our lives, we also maintain a multitude of much weaker connections: the distant colleagues that we share a ...
Jamie Lawrence, Terry R. Payne, David De Roure
GLVLSI
2003
IEEE
130views VLSI» more  GLVLSI 2003»
14 years 3 months ago
Zero overhead watermarking technique for FPGA designs
FPGAs, because of their re-programmability, are becoming very popular for creating and exchanging VLSI intellectual properties (IPs) in the reuse-based design paradigm. Existing w...
Adarsh K. Jain, Lin Yuan, Pushkin R. Pari, Gang Qu