2310 search results - page 108 / 462 » Coloring Random Graphs |
108
click to vote
CAAN
2004
Springer
15 years 7 months ago
2004
Springer
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
105
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
115
Voted
CVPR
2003
IEEE
16 years 4 months ago
2003
IEEE
In this paper we address the problem of fast segmenting moving objects in video acquired by moving camera or more generally with a moving background. We present an approach based ...
142
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper presents a new keypoint-based approach to nearduplicate images detection. It consists of three steps. Firstly, the keypoints of images are extracted and then matched. S...
114
click to vote
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...