Sciweavers

1871 search results - page 17 / 375
» The Ephemeral Pairing Problem
Sort
View
FDTC
2007
Springer
105views Cryptology» more  FDTC 2007»
14 years 1 months ago
Tate Pairing with Strong Fault Resiliency
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...
Erdinç Öztürk, Gunnar Gaubatz, Be...
WEBI
2009
Springer
14 years 2 months ago
Fast Matching for All Pairs Similarity Search
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...
Amit C. Awekar, Nagiza F. Samatova
PCI
2005
Springer
14 years 27 days ago
Closest Pair Queries with Spatial Constraints
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...
Apostolos N. Papadopoulos, Alexandros Nanopoulos, ...
ICDM
2008
IEEE
145views Data Mining» more  ICDM 2008»
14 years 1 months ago
Paired Learners for Concept Drift
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...
Stephen H. Bach, Marcus A. Maloof
GLOBECOM
2009
IEEE
13 years 11 months ago
Subcarrier-Pair Based Resource Allocation for Cooperative AF Multi-Relay OFDM Systems
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...
Wenbing Dang, Meixia Tao, Hua Mu, Jianwei Huang