Sciweavers

10602 search results - page 51 / 2121
» Weakly Useful Sequences
Sort
View
TCC
2007
Springer
86views Cryptology» more  TCC 2007»
14 years 3 months ago
Weakly-Private Secret Sharing Schemes
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
Amos Beimel, Matthew K. Franklin
DC
1999
13 years 8 months ago
A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
Michel Hurfin, Michel Raynal
ECCV
2008
Springer
14 years 11 months ago
Weakly Supervised Object Localization with Stable Segmentations
Multiple Instance Learning (MIL) provides a framework for training a discriminative classifier from data with ambiguous labels. This framework is well suited for the task of learni...
Carolina Galleguillos, Boris Babenko, Andrew Rabin...
IPPS
2009
IEEE
14 years 3 months ago
The Weak Mutual Exclusion problem
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
Paolo Romano, Luís Rodrigues, Nuno Carvalho
ICTCS
2007
Springer
14 years 3 months ago
Weak Markovian Bisimilarity: Abstracting from Prioritized/Weighted Internal Immediate Actions
ing from Prioritized/Weighted Internal Immediate Actions Marco Bernardo and Alessandro Aldini Universit`a di Urbino “Carlo Bo” – Italy Markovian process calculi constitute a ...
Marco Bernardo, Alessandro Aldini