2517 search results - page 32 / 504 » Specifying Weak Sets |
TCC
2009
Springer
16 years 10 days ago
2009
Springer
Various results show that oblivious transfer can be implemented using the assumption of noisy channels. Unfortunately, this assumption is not as weak as one might think, because i...
ICDCS
2008
IEEE
15 years 6 months ago
2008
IEEE
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...
107
click to vote
ICALP
1995
Springer
15 years 3 months ago
1995
Springer
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
102
click to vote
ICASSP
2010
IEEE
14 years 12 months ago
2010
IEEE
This paper addresses the training of classification trees for weakly labelled data. We call ”weakly labelled data”, a training set such as the prior labelling information pro...
SAC
2009
ACM
15 years 6 months ago
2009
ACM
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...