Sciweavers

1201 search results - page 90 / 241
» Linear Probing and Graphs
Sort
View
103
Voted
CORR
2007
Springer
60views Education» more  CORR 2007»
15 years 1 months ago
On Minimal Tree Realizations of Linear Codes
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Navin Kashyap
117
Voted
ICASSP
2009
IEEE
15 years 8 months 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
ICASSP
2008
IEEE
15 years 7 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
IJCAI
2007
15 years 2 months ago
Graph-Based Semi-Supervised Learning as a Generative Model
This paper proposes and develops a new graph-based semi-supervised learning method. Different from previous graph-based methods that are based on discriminative models, our method...
Jingrui He, Jaime G. Carbonell, Yan Liu 0002
105
Voted
ENDM
2008
123views more  ENDM 2008»
15 years 1 months ago
Morphing Planar Graph Drawings with Bent Edges
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
Anna Lubiw, Mark Petrick