4908 search results - page 91 / 982 » On the Complexity of Optimal K-Anonymity |
150
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Checking if microprocessor cores are fully functional at the end of the productive process has become a major issue. Traditional functional approaches are not sufficient when cons...
169
click to vote
IEAAIE
2004
Springer
15 years 11 months ago
2004
Springer
We present a new algorithm that provides an efficient localization method of elliptic industrial objects. Our proposed feature extraction inherits edge grouping approaches. But ins...
147
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
179
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
136
click to vote
ISAAC
2001
Springer
15 years 10 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...