Sciweavers

23 search results - page 2 / 5
» Denoising and Untangling Graphs Using Degree Priors
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Spatio-Temporal Markov Random Field for Video Denoising
This paper presents a novel spatio-temporal Markov random field (MRF) for video denoising. Two main issues are addressed in this paper, namely, the estimation of noise model and t...
Jia Chen, Chi-Keung Tang
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 7 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
COMPGEOM
2010
ACM
14 years 17 days ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
MOBIHOC
2002
ACM
14 years 7 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
ICIP
2008
IEEE
14 years 9 months ago
Variational Bayesian image processing on stochastic factor graphs
In this paper, we present a patch-based variational Bayesian framework of image processing using the language of factor graphs (FGs). The variable and factor nodes of FGs represen...
Xin Li