3265 search results - page 208 / 653 » Representing Groups on Graphs |
180
click to vote
MST
2006
15 years 4 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
129
click to vote
JMM2
2007
15 years 4 months ago
2007
— A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometr...
131
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
125
Voted
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
155
Voted
KI
2005
Springer
15 years 10 months ago
2005
Springer
To reason about geographical objects, it is not only necessary to have more or less complete information about where these objects are located in space, but also how they can chang...