75 search results - page 2 / 15 » Threshold Functions for Random Graphs on a Line Segment |
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
SCALESPACE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we provide a method to find global minimizers of certain non-convex 2-phase image segmentation problems. This is achieved by formulating a convex minimizat...
IBPRIA
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
COMBINATORICS
2006
13 years 7 months ago
2006
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
DM
2010
13 years 7 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...