4908 search results - page 327 / 982 » On the Complexity of Optimal K-Anonymity |
203
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
191
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract We present the first method to handle curvature regularity in region-based image segmentation and inpainting that is independent of initialization. To this end we start f...
184
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
197
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
203
click to vote
JMLR
2010
15 years 1 months ago
2010
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...