2125 search results - page 136 / 425 » On Graph Complexity |
188
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
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...
152
click to vote
ICASSP
2008
IEEE
16 years 25 days ago
2008
IEEE
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 ...
179
click to vote
IBPRIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
172
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
171
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...