152 search results - page 12 / 31 » Similarity Matrices for Pairs of Graphs |
COMBINATORICS
2004
13 years 7 months ago
2004
It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at l...
LATIN
2004
Springer
14 years 1 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
MVA
1998
13 years 9 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
JWSR
2007
13 years 7 months ago
2007
: Business processes continue to play an important role in today’s service-oriented enterprise computing systems. Mining, discovering, and integrating process-oriented services h...
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...