4908 search results - page 729 / 982 » On the Complexity of Optimal K-Anonymity |
169
click to vote
CHES
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
155
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
182
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
166
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
Because most animation tools are complex and timeconsuming to learn and use, most animations today are created by experts. To help novices create a wide range of animations quickl...
132
click to vote
VLSID
2003
IEEE
16 years 7 months ago
2003
IEEE
This paper quantifies the performance of typical functional unit interface designs in single-chip systems. We introduce a specific equation to guide the design of optimal module i...