Sciweavers

712 search results - page 52 / 143
» A mixture model for random graphs
Sort
View
CPC
2002
80views more  CPC 2002»
13 years 10 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger
FOCS
1993
IEEE
14 years 2 months ago
Simulated Annealing for Graph Bisection
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
Mark Jerrum, Gregory B. Sorkin
COLING
2010
13 years 5 months ago
FactRank: Random Walks on a Web of Facts
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
Alpa Jain, Patrick Pantel
DM
2007
83views more  DM 2007»
13 years 10 months ago
Codes identifying sets of vertices in random networks
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
Alan M. Frieze, Ryan Martin, Julien Moncel, Mikl&o...
CVPR
2007
IEEE
15 years 6 days 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