Sciweavers

398 search results - page 4 / 80
» A new biclustering technique based on crossing minimization
Sort
View
JCM
2007
156views more  JCM 2007»
13 years 7 months ago
MIMO Link Layer Transmission Techniques Based on Cross Layer Design
Abstract— In this paper, we propose and evaluate the performance of new link layer frame transmission techniques for MIMO (multiple input multiple output) wireless systems from a...
Wessam Ajib, David Haccoun, Jean-François F...
COCOON
2006
Springer
13 years 11 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
WEA
2007
Springer
112views Algorithms» more  WEA 2007»
14 years 1 months ago
Crossing Minimization in Weighted Bipartite Graphs
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
Olca A. Çakiroglu, Cesim Erten, Ömer K...
GLOBECOM
2008
IEEE
14 years 1 months ago
Cross-Layer Design of Optimal Adaptation Technique over Selection-Combining Diversity Nakagami-m Fading Channels
— Adaptive modulation and antenna diversity are two important enabling techniques for future wireless network to meet demand for high data rate transmission. We study a Markov de...
Ashok K. Karmokar, Vijay K. Bhargava
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
14 years 2 months ago
A Global k-Level Crossing Reduction Algorithm
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...