4908 search results - page 9 / 982 » On the Complexity of Optimal K-Anonymity |
123
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
—With the rise of XML as a standard for representing business data, XML data warehousing appears as a suitable solution for decision-support applications. In this context, it is ...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
All of the existing N-point discrete fractional signal transforms require O(N2 ) computation complexity. In this paper, we propose a new discrete fractional signal transform whose...
110
click to vote
PPDP
2010
Springer
14 years 9 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
212
click to vote
ESA
2011
Springer
13 years 11 months ago
2011
Springer
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
108
click to vote
ASIACRYPT
2010
Springer
14 years 9 months ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...