Carregant...
Carregant...

Vés al contingut (premeu Retorn)

An approximate algorithm for median graph computation using graph embedding

Autor
Ferrer, M.; Valveny, E.; Serratosa, F.; Riesen, K.; Bunke, H.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
19th International Conference on Pattern Recognition
Any de l'edició
2008
Data de presentació
2008
Llibre d'actes
19th International Conference on Pattern Recognition, 2008: ICPR 2008: 8-11 Dec. 2008, Tampa, Florida, USA
Pàgina inicial
1
Pàgina final
4
Editor
Institute of Electrical and Electronics Engineers (IEEE)
DOI
https://doi.org/10.1109/ICPR.2008.4761354 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/19342 Obrir en finestra nova
URL
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4761354&isnumber=4760915 Obrir en finestra nova
Resum
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for instance, how to obtain a representative of a set of graphs. The median graph has been defined for that purpose, but existing algorithms are computationally complex and have a very limited applicability. In this paper we propose a new approach for the computation of the median graph based on graph embedding in vector spaces....
Citació
Ferrer, M. [et al.]. An approximate algorithm for median graph computation using graph embedding. A: International Conference on Pattern Recognition. "19th International Conference on Pattern Recognition, 2008: ICPR 2008: 8-11 Dec. 2008, Tampa, Florida, USA". Tampa, Florida: Institute of Electrical and Electronics Engineers (IEEE), 2008, p. 1-4.
Grup de recerca
VIS - Visió Artificial i Sistemes Intel.ligents

Participants

  • Ferrer Sumsi, Miquel  (autor ponent)
  • Valveny Llobet, Ernest  (autor ponent)
  • Serratosa Casanelles, Francesc  (autor ponent)
  • Riesen, Kaspar  (autor ponent)
  • Bunke, Horst  (autor ponent)