4908 search results - page 199 / 982 » On the Complexity of Optimal K-Anonymity |
160
click to vote
GLOBECOM
2006
IEEE
16 years 18 days ago
2006
IEEE
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
165
click to vote
ICDM
2006
IEEE
16 years 18 days ago
2006
IEEE
Sequence data are abundant in application areas such as computational biology, environmental sciences, and telecommunications. Many real-life sequences have a strong segmental str...
168
click to vote
TRIDENTCOM
2006
IEEE
16 years 17 days ago
2006
IEEE
– This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. When any failure...
155
click to vote
SIGECOM
2005
ACM
16 years 3 days ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
165
click to vote
CPM
2005
Springer
16 years 2 days ago
2005
Springer
A square is the concatenation of two identical non-empty strings. Let S be the input string which is given character by character. Let m be the (unknown) smallest integer such that...