Sciweavers

2487 search results - page 314 / 498
» Partitions of Graphs into Trees
Sort
View
150
Voted
IPPS
2010
IEEE
15 years 1 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
ICIP
2009
IEEE
15 years 1 months ago
Markovian clustering for the non-local means image denoising
The non-local means filter is one of powerful denoising methods which allows participation of far, but proper pixels in the denoising process. Although the weights of non-similar ...
Rachid Hedjam, Reza Farrahi Moghaddam, Mohamed Che...
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
15 years 5 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh
151
Voted
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
15 years 1 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
109
Voted
GD
2007
Springer
15 years 9 months ago
Moving Vertices to Make Drawings Plane
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
Xavier Goaoc, Jan Kratochvíl, Yoshio Okamot...