38 search results - page 5 / 8 » nc 2008 |
CSR
2008
Springer
13 years 10 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
ICC
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper, we consider minimum bit error rate (BER) beamforming (BF) for multiple–input multiple–output orthogonal frequency division multiplexing (MIMO–OFDM) systems...
ENTCS
2008
13 years 8 months ago
2008
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...
ECCC
2008
13 years 8 months ago
2008
In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some distribution and decides whether they win or not base...
ICC
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper we investigate a realistic code acquisition assisted cooperative Non-Coherent (NC) Multiple-Input Multiple-Output (MIMO) DS-CDMA downlink scenario, when communica...