58 search results - page 3 / 12 » On Rank vs. Communication Complexity |
CVPR
2009
IEEE
15 years 27 days ago
2009
IEEE
Active learning strategies can be useful when manual labeling
effort is scarce, as they select the most informative
examples to be annotated first. However, for visual category
...
COCO
2009
Springer
14 years 11 days ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
INFOCOM
2009
IEEE
14 years 13 days ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
DAC
2010
ACM
13 years 6 months ago
2010
ACM
Packet-switched networks-on-chip (NoC) have been proposed as an efficient communication infrastructure for multi-core architectures. Adding virtual channels to a NoC helps to avoi...