501 search results - page 87 / 101 » Communication Lower Bounds Using Dual Polynomials |
GLOBECOM
2008
IEEE
14 years 3 months ago
2008
IEEE
— We consider beamforming in a cognitive network with multiple primary users and secondary users sharing the same spectrum. In particular, we assume that each secondary transmitt...
ENTCS
2008
13 years 8 months ago
2008
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
ASUNAM
2011
IEEE
12 years 8 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
SIROCCO
2007
13 years 10 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...