Sciweavers

2272 search results - page 212 / 455
» Provable Data Privacy
Sort
View
108
Voted
IWMM
2004
Springer
94views Hardware» more  IWMM 2004»
15 years 6 months ago
General adaptive replacement policies
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...
Yannis Smaragdakis
103
Voted
CPM
2010
Springer
140views Combinatorics» more  CPM 2010»
15 years 5 months ago
Bounds on the Minimum Mosaic of Population Sequences under Recombination
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...
Yufeng Wu
115
Voted
ASIACRYPT
2000
Springer
15 years 5 months ago
Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques
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...
Michel Abdalla, Mihir Bellare
ASM
2000
ASM
15 years 5 months ago
Modeling the Dynamics of UML State Machines
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...
Egon Börger, Alessandra Cavarra, Elvinia Ricc...
COMPGEOM
1997
ACM
15 years 5 months ago
Time-Series Similarity Problems and Well-Separated Geometric Sets
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...
Béla Bollobás, Gautam Das, Dimitrios...