806 search results - page 4 / 162 » Lower Bounds on Correction Networks |
IEEECIT
2006
IEEE
14 years 1 months ago
2006
IEEE
Localization is a basic and critical requirement for wireless sensor network applications, e.g. target tracking, monitoring and intrusion detection. In the received signal strengt...
STOC
2000
ACM
13 years 12 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
IWANN
2009
Springer
14 years 6 days ago
2009
Springer
We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...
NETWORKS
2006
13 years 7 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
NETWORKS
2008
13 years 7 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...