4009 search results - page 335 / 802 » Clustering on Complex Graphs |
225
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
187
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--The growing complexity in computer system hierarchies due to the increase in the number of cores per processor, levels of cache (some of them shared) and the number of pr...
174
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
186
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Implementing real-time video processing systems put high requirements on computation and memory performance. FPGAs have proven to be effective implementation architecture for thes...
142
click to vote
ENDM
2007
15 years 6 months ago
2007
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...