2168 search results - page 316 / 434 » Randomized Algorithms and Complexity Theory |
126
click to vote
JSAC
2006
15 years 3 months ago
2006
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
128
click to vote
TWC
2008
15 years 3 months ago
2008
In this paper, a dynamic subcarrier and power allocation problem is considered in the context of asymptotic utility maximization in multi-carrier systems. Using the gradient-based...
147
Voted
MOBIHOC
2010
ACM
15 years 1 months ago
2010
ACM
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
134
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
114
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...