4908 search results - page 235 / 982 » On the Complexity of Optimal K-Anonymity |
186
click to vote
UAI
2003
15 years 8 months ago
2003
Real-world distributed systems and networks are often unreliable and subject to random failures of its components. Such a stochastic behavior affects adversely the complexity of o...
164
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Increasing teamwork between agents typically increases the performance of a multi-agent system, at the cost of increased communication and higher computational complexity. This wo...
165
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...
160
click to vote
JCM
2006
15 years 6 months ago
2006
Decentralized sensor networks are collections of individual local sensors that observe a common phenomenon, quantize their observations, and send this quantized information to a ce...
198
click to vote
PAMI
2006
15 years 6 months ago
2006
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....