Sciweavers

458 search results - page 8 / 92
» Totally magic graphs
Sort
View
SCALESPACE
2009
Springer
14 years 3 months ago
L0-Norm and Total Variation for Wavelet Inpainting
Abstract. In this paper, we suggest an algorithm to recover an image whose wavelet coefficients are partially lost. We propose a wavelet inpainting model by using L0-norm and the t...
Andy C. Yau, Xue-Cheng Tai, Michael K. Ng
DAM
2000
199views more  DAM 2000»
13 years 8 months ago
Approximation algorithms for the shortest total path length spanning tree problem
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
ILP
2003
Springer
14 years 1 months ago
On Condensation of a Clause
In this paper, we investigate condensation of a clause. First, we extend a substitution graph introduced by Scheffer et al. (1996) to a total matcher graph. Then, we give a correc...
Kouichi Hirata
DM
2010
115views more  DM 2010»
13 years 8 months ago
Edge colouring by total labellings
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
Stephan Brandt, Kristína Budajová, D...
WWW
2005
ACM
14 years 9 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi