Sciweavers

481 search results - page 32 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
ASIACRYPT
2009
Springer
14 years 3 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
14 years 3 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
ALGORITHMICA
2010
88views more  ALGORITHMICA 2010»
13 years 8 months ago
Improved Bounds for Wireless Localization
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, T...
CSFW
2009
IEEE
14 years 3 months ago
Minimal Message Complexity of Asynchronous Multi-party Contract Signing
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
Sjouke Mauw, Sasa Radomirovic, Mohammad Torabi Das...
DGCI
2009
Springer
14 years 3 months ago
Distances on Lozenge Tilings
In this paper, a structural property of the set of lozenge tilings of a 2n-gon is highlighted. We introduce a simple combinatorial value called Hamming-distance, which is a lower b...
Olivier Bodini, Thomas Fernique, Eric Rémil...