1871 search results - page 17 / 375 » The Ephemeral Pairing Problem |
144
click to vote
FDTC
2007
Springer
16 years 22 days ago
2007
Springer
We present a novel non-linear error coding framework which incorporates strong adversarial fault detection capabilities into identity based encryption schemes built using Tate pai...
173
click to vote
WEBI
2009
Springer
16 years 1 months ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
172
click to vote
PCI
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
161
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas a reactive learner predicts ba...
166
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
We study the joint allocation of three types of resources, namely, power, subcarriers and relay nodes, in cooperative two-hop multi-relay OFDM systems. Each relay adopts the amplif...