4908 search results - page 60 / 982 » On the Complexity of Optimal K-Anonymity |
174
click to vote
GRAMMARS
2002
15 years 6 months ago
2002
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
195
click to vote
DAC
1998
ACM
15 years 10 months ago
1998
ACM
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
163
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
150
click to vote
EOR
2006
15 years 6 months ago
2006
In this paper we develop an open queueing network for optimal design of multi-stage assemblies, in which each service station represents a manufacturing or assembly operation. The...