Sciweavers

750 search results - page 28 / 150
» Reconstruction for Models on Random Graphs
Sort
View
ICIP
2009
IEEE
13 years 6 months ago
Fluorescence diffuse optical image reconstruction with a priori information
This paper addresses fluorescence diffuse optical tomography (FDOT) reconstruction problem with a priori information. We assume that approximate location of the fluorophore concen...
Lu Zhou, An Jin, Birsen Yazici
ACCV
2009
Springer
14 years 3 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 8 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 3 months ago
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
Alan M. Frieze, Charalampos E. Tsourakakis
CIKM
2008
Springer
13 years 10 months ago
A random walk on the red carpet: rating movies with user reviews and pagerank
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
Derry Tanti Wijaya, Stéphane Bressan