750 search results - page 50 / 150 » Reconstruction for Models on Random Graphs |
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
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...
120
click to vote
COMGEO
1999
ACM
14 years 11 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
104
click to vote
AOSD
2007
ACM
15 years 3 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
111
click to vote
JUCS
2008
14 years 11 months ago
2008
: In the paper we study parallel key exchange among multiple parties. The status of parallel key exchange can be depicted by a key graph. In a key graph, a vertex represents a part...
114
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...