Sciweavers

2517 search results - page 25 / 504
» Specifying Weak Sets
Sort
View
CVPR
2012
IEEE
13 years 2 months ago
Learning object class detectors from weakly annotated video
Object detectors are typically trained on a large set of still images annotated by bounding-boxes. This paper introduces an approach for learning object detectors from realworld w...
Alessandro Prest, Christian Leistner, Javier Civer...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 12 days ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
16 years 2 days ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
CONCUR
1994
Springer
15 years 3 months ago
Weak Sequential Composition in Process Algebras
Abstract. In this paper we study a special operator for sequential composition, which is de ned relative to a dependency relation over the actions of a given system. The idea is th...
Arend Rensink, Heike Wehrheim
ACL
2009
14 years 9 months ago
Multi-Task Transfer Learning for Weakly-Supervised Relation Extraction
Creating labeled training data for relation extraction is expensive. In this paper, we study relation extraction in a special weakly-supervised setting when we have only a few see...
Jing Jiang