1871 search results - page 246 / 375 » The Ephemeral Pairing Problem |
184
click to vote
DAM
2008
15 years 6 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
164
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
235
click to vote
ICALP
2011
Springer
14 years 10 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 ...
255
click to vote
Publication
Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival pr...
206
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Stereo matching commonly requires rectified images that
are computed from calibrated cameras. Since all under-
lying parametric camera models are only approximations,
calibratio...