4908 search results - page 384 / 982 » On the Complexity of Optimal K-Anonymity |
181
click to vote
TOH
2010
15 years 5 months ago
2010
—This paper is concerned with investigating the factors that contribute to optimizing information transfer (IT) rate in humans. With an increasing interest in designing complex h...
195
click to vote
NIPS
2007
15 years 8 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
193
click to vote
IPL
2006
15 years 6 months ago
2006
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
289
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...
163
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...