828 search results - page 58 / 166 » Simplicial Powers of Graphs |
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
ALT
2007
Springer
14 years 5 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
GBRPR
2005
Springer
14 years 2 months ago
2005
Springer
Shock graphs have emerged as a powerful generic 2-D shape representation. However, most approaches typically assume that the silhouette has been correctly segmented. In this paper,...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...
CVPR
2003
IEEE
14 years 10 months ago
2003
IEEE
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...