5592 search results - page 166 / 1119 » On Random Betweenness Constraints |
148
Voted
EUROCRYPT
2009
Springer
16 years 5 months ago
2009
Springer
We propose a methodology to construct verifiable random functions from a class of identity based key encapsulation mechanisms (IB-KEM) that we call VRF suitable. Informally, an IB-...
121
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
147
click to vote
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
Background subtraction is a crucial step in many automatic video content analysis applications. While numerous acceptable techniques have been proposed so far for background extra...
146
click to vote
ICDM
2009
IEEE
15 years 11 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 ...
160
click to vote
GLOBECOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—In a distributed wireless network, it is possible to employ several relays and mimic a multiple antenna transmission system. In this paper we propose a MAC layer solution that a...