534 search results - page 35 / 107 » Power from Random Strings |
EUROCRYPT
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
ACCV
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
Discriminative tracking has become popular tracking methods due to their descriptive power for foreground/background separation. Among these methods, online random forest is recen...
ICDM
2009
IEEE
14 years 5 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
SECON
2007
IEEE
14 years 5 months ago
2007
IEEE
— In this paper we study two-hop cooperative diversity relaying in random wireless networks. In contrast to most work on cooperative diversity relaying where the relay node posit...