1949 search results - page 242 / 390 » Random graphs on surfaces |
222
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
204
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
159
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
161
click to vote
ICCD
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
158
click to vote
ISAAC
1998
Springer
15 years 10 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...