Sciweavers

3204 search results - page 133 / 641
» The Alcuin Number of a Graph
Sort
View
ICASSP
2009
IEEE
16 years 17 days ago
Factor graph based design of an OFDM-IDMA receiver performing joint data detection, channel estimation, and channel length selec
We present a factor graph based design of a receiver for pilotassisted OFDM-IDMA systems transmitting over frequency-selective channels. The receiver performs joint iterative mult...
Clemens Novak, Gerald Matz, Franz Hlawatsch
COCOON
2009
Springer
16 years 12 days ago
Sublinear-Time Algorithms for Tournament Graphs
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
ICASSP
2008
IEEE
16 years 8 days ago
A factor graph approach to joint iterative data detection and channel estimation in pilot-assisted IDMA transmissions
We consider a pilot-assisted interleave-division multiple access (IDMA) system transmitting over block-fading channels. We describe this system in terms of a factor graph and use ...
Clemens Novak, Gerald Matz, Franz Hlawatsch
WONS
2005
IEEE
15 years 11 months ago
Frequency Allocation for WLANs Using Graph Colouring Techniques
At present, no standard frequency allocation mechanism exists for Wireless LAN access points. In this article, we introduce a number of techniques based on graph colouring algorit...
Janne Riihijärvi, Marina Petrova, Petri M&aum...
ESA
2005
Springer
131views Algorithms» more  ESA 2005»
15 years 11 months ago
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...