Sciweavers

3937 search results - page 666 / 788
» Questioning Ubiquitous Computing
Sort
View
CORR
2008
Springer
145views Education» more  CORR 2008»
13 years 8 months ago
The Capacity Region of Large Wireless Networks
The capacity region of a wireless network with n nodes is the set of all simultaneously achievable rates between all possible n2 node pairs. In this paper, we consider the questio...
Urs Niesen, Piyush Gupta, Devavrat Shah
ECEASST
2008
88views more  ECEASST 2008»
13 years 8 months ago
Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
Steffen Mazanek, Mark Minas
COR
2006
122views more  COR 2006»
13 years 8 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
DSP
2006
13 years 8 months ago
Matrix pencil method for simultaneously estimating azimuth and elevation angles of arrival along with the frequency of the incom
In this paper we describe a method for simultaneously estimating the direction of arrival (DOA) of the signal along with its unknown frequency. In a typical DOA estimation problem...
Nuri Yilmazer, Raul Fernandez-Recio, Tapan K. Sark...
ICGA
2006
128views Optimization» more  ICGA 2006»
13 years 8 months ago
Never-Ending Moves in Bao
Bao is a member of the large family of mancala games. It is generally considered to be the most complex mancala game with respect to the number of game rules (Townshend, 1986; De ...
Tom Kronenburg, H. H. L. M. Donkers, Alex J. de Vo...