4934 search results - page 350 / 987 » complexity 2008 |
158
click to vote
DBSEC
2008
15 years 8 months ago
2008
Abstract. When generalization algorithms are known to the public, an adversary can obtain a more precise estimation of the secret table than what can be deduced from the disclosed ...
195
click to vote
DBSEC
2008
15 years 8 months ago
2008
To protect critical resources in today’s networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities....
191
click to vote
GRIDNETS
2008
15 years 8 months ago
2008
In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interferenc...
199
click to vote
ADHOC
2008
15 years 7 months ago
2008
This paper addresses the problem of configuring wireless sensor networks (WSNs). Specifically, we seek answers to the following questions: how many sensors should be deployed, wha...
157
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...