279 search results - page 21 / 56 » Approximating Average Parameters of Graphs |
151
Voted
TIP
2008
15 years 2 months ago
2008
The bilateral filter is a nonlinear filter that does spatial averaging without smoothing edges; it has shown to be an effective image denoising technique. An important issue with t...
166
click to vote
COMGEO
2012
ACM
13 years 10 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
138
Voted
ISAAC
2010
Springer
15 years 19 days ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
123
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
120
Voted
ICDM
2009
IEEE
15 years 14 days ago
2009
IEEE
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...