1115 search results - page 62 / 223 » Separating Shape Graphs |
DAM
2007
13 years 10 months ago
2007
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
ICIP
2007
IEEE
15 years 16 days ago
2007
IEEE
Misregistration between the color separations of a printed image, which is often inevitable, can cause objectionable color shifts in average color. We analyze the impact of inter-...
CEC
2003
IEEE
14 years 4 months ago
2003
IEEE
The aim of this work is to utilize an evolutationary algorithm to evolve the microstructure of an object created by a stereolithography machine. This should be optimised to be able...
JCP
2008
13 years 10 months ago
2008
Finding clusters with widely differing sizes, shapes and densities in presence of noise and outliers is a challenging job. The DBSCAN is a versatile clustering algorithm that can f...