4009 search results - page 322 / 802 » Clustering on Complex Graphs |
163
click to vote
ICASSP
2008
IEEE
16 years 1 months 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 ...
188
click to vote
IBPRIA
2003
Springer
15 years 12 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...
182
click to vote
ISAAC
2003
Springer
15 years 12 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...
186
Voted
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 ...
158
click to vote
DAM
2010
15 years 6 months ago
2010
We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n - 1 node-di...