2272 search results - page 212 / 455 » Provable Data Privacy |
122
Voted
IWMM
2004
Springer
15 years 8 months ago
2004
Springer
We propose a general scheme for creating adaptive replacement policies with good performance and strong theoretical guarantees. Specifically, we show how to combine any two exist...
118
click to vote
CPM
2010
Springer
15 years 7 months ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
130
Voted
ASIACRYPT
2000
Springer
15 years 7 months ago
2000
Springer
Rather than use a shared key directly to cryptographically process (e.g. encrypt or authenticate) data one can use it as a master key to derive subkeys, and use the subkeys for the...
131
Voted
ASM
2000
ASM
15 years 7 months ago
2000
ASM
We define the dynamic semantics of UML State Machines which integrate statecharts with the UML object model. The use of ASMs allows us (a) to rigorously model the event driven run...
113
Voted
COMPGEOM
1997
ACM
15 years 6 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...