147 search results - page 16 / 30 » Vertex partitions of chordal graphs |
128
click to vote
DISOPT
2008
15 years 6 months ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
138
click to vote
CLASSIFICATION
2008
15 years 6 months ago
2008
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
179
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
206
click to vote
IPPS
2007
IEEE
16 years 11 days ago
2007
IEEE
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...
148
click to vote
VRML
1998
ACM
15 years 10 months ago
1998
ACM
We present a new method for (1) automatically generating multiple Levels Of Detail (LODs) of a polygonal surface, (2) progressively loading, or transmitting, and displaying a surf...