16404 search results - page 2641 / 3281 » A set coverage problem |
165
click to vote
ASIACRYPT
2001
Springer
15 years 11 months ago
2001
Springer
We consider a novel security requirement of encryption schemes that we call “key-privacy” or “anonymity”. It asks that an eavesdropper in possession of a ciphertext not be ...
191
click to vote
CIKM
2001
Springer
15 years 11 months ago
2001
Springer
This paper addresses the problem of automatic detection of salient video segments for real-world applications such as corporate training based on associated speech transcriptions....
182
click to vote
CP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
201
click to vote
DAWAK
2001
Springer
15 years 11 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
173
click to vote
ECML
2001
Springer
15 years 11 months ago
2001
Springer
We present a powerful meta-clustering technique called Iterative Double Clustering (IDC). The IDC method is a natural extension of the recent Double Clustering (DC) method of Slon...