524 search results - page 46 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, we investigate the maximization of the amount of gathered data in a clustered wireless sensor network (WSN). The amount of gathered data is maximized by (1) choosing...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
JGAA
2007
13 years 7 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
DAC
1994
ACM
13 years 12 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...