Sciweavers

923 search results - page 123 / 185
» Proving the value of formal methods
Sort
View
COCOON
2010
Springer
15 years 11 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen

Publication
314views
15 years 2 months ago
On the use of discrete Pascal transform in hiding data in images
The Discrete Pascal Transform (DPT) has been proved remarkably useful for edge detection, filter design, discrete-time signal interpolation and data hiding. In the present work a n...
E. E. Varsaki, V. Fotopoulos and A. N. Skodras
SACRYPT
2004
Springer
105views Cryptology» more  SACRYPT 2004»
15 years 11 months ago
Provably Secure Masking of AES
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...
Johannes Blömer, Jorge Guajardo, Volker Krumm...
ECOWS
2009
Springer
15 years 9 months ago
Run-time Verification of Behavioural Conformance for Conversational Web Services
— Web services exposing run-time behaviour that deviates from their behavioural specifications represent a major threat to the sustainability of a service-oriented ecosystem. It ...
Dimitris Dranidis, Ervin Ramollari, Dimitrios Kour...
ICALP
2009
Springer
16 years 6 months ago
Sorting and Selection with Imprecise Comparisons
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
Avinatan Hassidim, Jelani Nelson, Miklós Aj...