Sciweavers

2432 search results - page 94 / 487
» Degrees and choice numbers
Sort
View
GLOBECOM
2010
IEEE
15 years 4 months ago
Exploiting Channel Correlations - Simple Interference Alignment Schemes with No CSIT
We explore a few selected multiuser communication problems where the possibility of interference alignment, and consequently the total number of degrees of freedom (DoF) with chann...
Syed Ali Jafar
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 10 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
ECIS
2000
15 years 7 months ago
Information Systems Research Education in Australasia: Continuing the Past or Gearing Up for the Future
As the information systems discipline grows, so do the number of programs offering graduate research degrees (GRD). In Australasia these include one year post-graduate (honors) pr...
Beverley G. Hope, M. Fergusson
ICALT
2009
IEEE
16 years 1 months ago
A Conceptual Framework for Serious Games
A considerable number of serious games have been developed over the last ten years, with varying degrees of success. Due to a lack of clear standards and guidelines for game devel...
Amri Yusoff, Richard M. Crowder, Lester Gilbert, G...
WG
2009
Springer
16 years 26 days ago
Exact and Parameterized Algorithms for Max Internal Spanning Tree
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
Henning Fernau, Serge Gaspers, Daniel Raible