465 search results - page 70 / 93 » On the Hardness of Range Assignment Problems |
100
click to vote
EJC
2008
14 years 12 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
204
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such th...
RIVF
2007
15 years 1 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
109
click to vote
IS
2012
13 years 7 months ago
2012
When transforming data one often wants certain information in the data source to be preserved, i.e., we identify parts of the source data and require these parts to be transformed...
101
click to vote
COMSWARE
2006
IEEE
15 years 6 months ago
2006
IEEE
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...