Sciweavers

865 search results - page 78 / 173
» Random graph models for the web graph
Sort
View
WWW
2005
ACM
16 years 4 months ago
Adaptive page ranking with neural networks
Recent developments in the area of neural networks provided new models which are capable of processing general types of graph structures. Neural networks are well-known for their ...
Franco Scarselli, Sweah Liang Yong, Markus Hagenbu...
160
Voted
MICCAI
2010
Springer
15 years 2 months ago
3D Knowledge-Based Segmentation Using Pose-Invariant Higher-Order Graphs
Segmentation is a fundamental problem in medical image analysis. The use of prior knowledge is often considered to address the ill-posedness of the process. Such a process consists...
Chaohui Wang, Olivier Teboul, Fabrice Michel, Salm...
CORR
2007
Springer
86views Education» more  CORR 2007»
15 years 3 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert
128
Voted
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 3 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
121
Voted
RSA
2010
107views more  RSA 2010»
15 years 2 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou