4908 search results - page 146 / 982 » On the Complexity of Optimal K-Anonymity |
180
click to vote
MP
2006
15 years 6 months ago
2006
We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We f...
168
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a priori knowle...
160
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
142
click to vote
ICCD
2008
IEEE
16 years 3 months ago
2008
IEEE
— Circuit and processor designs will continue to increase in complexity for the foreseeable future. With these increasing sizes comes the use of wide buses to move large amounts ...
184
click to vote
ATAL
2005
Springer
16 years 3 hour ago
2005
Springer
We consider a multiagent system whose task is to aid componentcentered design by collaborative designers in a supply chain. In the earlier work, collaborative design networks are ...