4908 search results - page 105 / 982 » On the Complexity of Optimal K-Anonymity |
147
click to vote
GLOBECOM
2008
IEEE
16 years 25 days ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
141
click to vote
ICC
2007
IEEE
16 years 21 days ago
2007
IEEE
— An interferometric ranging technique has been recently proposed as a possible way to localize ad hoc and sensor networks. Compared to the more common techniques such as receive...
192
click to vote
IEEEARES
2006
IEEE
16 years 12 days ago
2006
IEEE
Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic...
164
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
Many industrial or research activities are so expensive that it is often benefitable for the involved agents to cofund the construction or the purchase of a common required resou...
186
click to vote
ICNC
2005
Springer
15 years 12 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...