38 search results - page 2 / 8 » Complexity of Intensive Communications on Balanced Generaliz... |
ICCAD
2003
IEEE
14 years 2 months ago
2003
IEEE
— Memory-intensive applications present unique challenges to an ASIC designer in terms of the choice of memory organization, memory size requirements, bandwidth and access latenc...
COCO
2009
Springer
13 years 9 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
MOBISYS
2007
ACM
14 years 4 months ago
2007
ACM
The ease of deployment of battery-powered and mobile systems is pushing the network edge far from powered infrastructures. A primary challenge in building untethered systems is of...
IWCMC
2010
ACM
13 years 3 months ago
2010
ACM
Load imbalance that deteriorates the system performance is a severe problem existing in 3GPP LTE networks. To deal with this problem, we propose in this paper a load balancing fra...