1664 search results - page 160 / 333 » Distance labeling in graphs |
127
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we present a novel feature extraction framework, called learning by propagability. The whole learning process is driven by the philosophy that the data labels and o...
147
click to vote
ESWS
2006
Springer
15 years 8 months ago
2006
Springer
Classifications have been used for centuries with the goal of cataloguing and searching large sets of objects. In the early days it was mainly books; lately it has also become Web ...
144
click to vote
CIVR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we propose a novel Markov model-based formulation for the image annotation problem. In this formulation, we treat image annotation as a graph ranking problem, by de...
153
click to vote
ALGORITHMICA
1998
15 years 4 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
256
click to vote
ICDE
2006
IEEE
16 years 6 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...