Sciweavers

3204 search results - page 189 / 641
» The b-chromatic Number of a Graph
Sort
View
ICASSP
2008
IEEE
14 years 4 months 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
14 years 4 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»
14 years 3 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...
IPTPS
2004
Springer
14 years 3 months ago
Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...
Moni Naor, Udi Wieder
ASAP
2006
IEEE
162views Hardware» more  ASAP 2006»
14 years 2 months ago
Affine Nested Loop Programs and their Binary Parameterized Dataflow Graph Counterparts
Parameterized static affine nested loop programs can be automatically converted to input-output equivalent Kahn Process Network specifications. These networks turn out to be close...
Ed F. Deprettere, Todor Stefanov, Shuvra S. Bhatta...