Sciweavers

2310 search results - page 224 / 462
» Coloring Random Graphs
Sort
View
ALGORITHMICA
2007
93views more  ALGORITHMICA 2007»
13 years 8 months ago
Random 2-SAT with Prescribed Literal Degrees
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
Colin Cooper, Alan M. Frieze, Gregory B. Sorkin
ISCAS
2006
IEEE
118views Hardware» more  ISCAS 2006»
14 years 2 months ago
Complex network topologies and synchronization
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
Paolo Checco, Mario Biey, Gábor Vattay, Lju...
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
14 years 11 days ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 12 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
ICPR
2010
IEEE
14 years 20 days ago
Fast and Spatially-Smooth Terrain Classification Using Monocular Camera
In this paper, we present a monocular camera based terrain classification scheme. The uniqueness of the proposed scheme is that it inherently incorporates spatial smoothness while...
Chetan Jakkoju, Madhava Krishna, C. V. Jawahar