1067 search results - page 25 / 214 » Probabilistic regular graphs |
97
Voted
JCT
2007
15 years 10 days ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
116
click to vote
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
We present local and nonlocal algorithms for video denoising based on discrete regularization on graphs. The main difference between video and image denoising is the temporal redu...
110
Voted
ACCV
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Diffusion Tensor Imaging (DTI) provides estimates of local directional information regarding paths of white matter tracts in the human brain. An important problem in DTI ...
109
click to vote
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...