4908 search results - page 757 / 982 » On the Complexity of Optimal K-Anonymity |
186
click to vote
P2P
2007
IEEE
16 years 27 days ago
2007
IEEE
An important security issue in DHT-based structured overlay networks is to provide anonymity to the storage nodes. Compromised routing tables in those DHTs leak information about ...
184
click to vote
QEST
2007
IEEE
16 years 27 days ago
2007
IEEE
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
181
click to vote
RTSS
2007
IEEE
16 years 27 days ago
2007
IEEE
Creating robust real-time embedded software is critical in combining the physical world with computing, such as in consumer electronics or robotics. One challenge is the complexit...
178
click to vote
SASO
2007
IEEE
16 years 27 days ago
2007
IEEE
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
198
click to vote
ATVA
2007
Springer
16 years 24 days ago
2007
Springer
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...