38 search results - page 2 / 8 » Complexity of Intensive Communications on Balanced Generaliz... |
134
Voted
ICCAD
2003
IEEE
16 years 18 days 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...
117
Voted
COCO
2009
Springer
15 years 7 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 ...
112
Voted
FOCS
2003
IEEE
15 years 9 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...
128
Voted
MOBISYS
2007
ACM
16 years 3 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...
203
Voted
IWCMC
2010
ACM
15 years 1 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...