240 search results - page 16 / 48 » Efficient Variants of the Backward-Oracle-Matching Algorithm |
AAECC
2009
Springer
14 years 19 days ago
2009
Springer
Abstract. We build on the new security notion for deterministic encryption (PRIV) and the PRIV-secure schemes presented by Bellare et al at Crypto'07. Our work introduces: 1) ...
DIS
2007
Springer
14 years 16 days ago
2007
Springer
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
STOC
1993
ACM
14 years 20 days ago
1993
ACM
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
IPL
2002
13 years 8 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...