Sciweavers

2310 search results - page 374 / 462
» Coloring Random Graphs
Sort
View
SOCIALCOM
2010
13 years 5 months ago
The Dynamics of Two Cognitive Heuristics for Coordination on Networks
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
Iyad Rahwan, Fatemeh Jahedpari, Sherief Abdallah
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 2 months ago
A new approach to nonrepetitive sequences
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
ICCV
2005
IEEE
14 years 9 months ago
Incorporating Visual Knowledge Representation in Stereo Reconstruction
In this paper, we present a two-layer generative model that incorporates generic middle-level visual knowledge for dense stereo reconstruction. The visual knowledge is represented...
Adrian Barbu, Song Chun Zhu
ECCV
2004
Springer
14 years 9 months ago
Interactive Image Segmentation Using an Adaptive GMMRF Model
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
Andrew Blake, Carsten Rother, M. Brown, Patrick P&...
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
14 years 8 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...