62 search results - page 4 / 13 » Generating Random Graphs with Large Girth |
121
Voted
CPC
2007
15 years 2 months ago
2007
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
125
click to vote
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...
100
click to vote
CORR
2002
Springer
15 years 2 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
123
Voted
MICCAI
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
152
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
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...