2430 search results - page 255 / 486 » Computing Tutte Polynomials |
136
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
130
click to vote
IJCNN
2008
IEEE
15 years 10 months ago
2008
IEEE
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
128
click to vote
PIMRC
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
151
Voted
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
126
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...