2517 search results - page 25 / 504 » Specifying Weak Sets |
133
Voted
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
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...
139
Voted
STOC
2009
ACM
16 years 2 months ago
2009
ACM
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...
119
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
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. ...
115
click to vote
CONCUR
1994
Springer
15 years 6 months ago
1994
Springer
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...
153
click to vote
ACL
2009
14 years 11 months ago
2009
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...