Sciweavers

6562 search results - page 311 / 1313
» Noetherianity and Combination Problems
Sort
View
CIKM
2010
Springer
15 years 4 months ago
Anonymizing data with quasi-sensitive attribute values
We study the problem of anonymizing data with quasi-sensitive attributes. Quasi-sensitive attributes are not sensitive by themselves, but certain values or their combinations may ...
Pu Shi, Li Xiong, Benjamin C. M. Fung
TRIDENTCOM
2010
IEEE
15 years 4 months ago
G-Lab Deep: Cross-Layer Composition and Security for a Flexible Future Internet
The Internet enables the way how global businesses and communities communicate today. In the last years, however, new demands have collided with old designs, resulting in a complex...
Carsten Schmoll, Christian Henke, Dirk Hoffstadt, ...
VTC
2010
IEEE
135views Communications» more  VTC 2010»
15 years 4 months ago
Biconnecting a Network of Mobile Robots Using Virtual Angular Forces
This paper proposes a new solution to the problem of self-deploying a network of wireless mobile robots with simultaneous consideration to several criteria, that are, the fault-tol...
Arnaud Casteigts, Jeremie Albert, Serge Chaumette,...
CIKM
2010
Springer
15 years 1 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
EJWCN
2010
229views more  EJWCN 2010»
15 years 1 months ago
Throughput-Efficient Dynamic Coalition Formation in Distributed Cognitive Radio Networks
We formulate the problem of distributed throughput-efficient sensing in cognitive radio (CR) networks as a dynamic coalition formation game based on a Markovian model. The propose...
Zaheer Khan, Janne J. Lehtomäki, Marian Codre...