287 search results - page 39 / 58 » Communication complexity as a lower bound for learning in ga... |
PODC
2009
ACM
14 years 9 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
WG
1998
Springer
14 years 25 days ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
COCO
2008
Springer
13 years 10 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract—The problem of cooperative allocation among multiple secondary users to maximize cognitive system throughput is considered. The channel availability statistics are initi...
IJMMS
2007
13 years 8 months ago
2007
The investigation of innovative Human–Computer Interfaces (HCI) provides a challenge for future interaction research and development. Brain–Computer Interfaces (BCIs) exploit ...