Ara es mostren els items 1-11 de 11

  • A generic framework for median graph computation based on a recursive embedding approach 

    Ferrer Sumsi, Miquel; Karatzas, D; Valveny, Ernest; Bardaji Goikoetxea, Itziar; Bunke, Horst (2011)
    Article
    Accés obert
    The median graph has been shown to be a good choice to obtain a representative of a set of graphs. However, its computation is a complex problem. Recently, graph embedding into vector spaces has been proposed to obtain ...
  • A recursive embedding approach to median graph computation 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Bunke, Horst (Springer Verlag, 2009-06-12)
    Capítol de llibre
    Accés obert
    The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely ...
  • An approximate algorithm for median graph computation using graph embedding 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Riesen, Kaspar; Bunke, Horst (Institute of Electrical and Electronics Engineers (IEEE), 2008)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    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 ...
  • Application of graph embedding to solve graph matching problems 

    Valveny, Ernest; Ferrer Sumsi, Miquel (2008)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    Graphs have very interesting properties for object representation in pattern recognition. However, graph matching algorithms are usually computationally complex. In addition, graphs are harder to manipulate and operate ...
  • Aprendizaje cooperativo aplicado a la docencia de las asignaturas de programación en ingeniería informática 

    Ferrer Sumsi, Miquel; Benavente, Robert; Valveny, Ernest; Garcia-Barnés, Jaume; Lapedriza, A.; Sànchez, Gemma (2011)
    Text en actes de congrés
    Accés obert
    En este trabajo se presentan los resultados de la aplicación de la metodología del aprendizaje cooperativo a la docencia de dos asignaturas de programación en ingeniería informática. ‘Algoritmos y programación’ y ‘Lenguajes ...
  • Combination of OCR engines for page segmentation based on performance evaluation 

    Ferrer Sumsi, Miquel; Valveny, Ernest (Institute of Electrical and Electronics Engineers (IEEE), 2007)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    In this paper we present a method to improve the performance of individual page segmentation engines based on the combination of the output of several engines. The rules of combination are designed after analyzing the ...
  • Generalized median graph computation by means of graph embedding in vector spaces 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Riesen, Kaspar; Bunke, Horst (2010)
    Article
    Accés restringit per política de l'editorial
    The median graph has been presented as a useful tool to represent a set of graphs. Nevertheless its computation is very complex and the existing algorithms are restricted to use limited amount of data. In this paper we ...
  • Graph-based k-means clustering: A comparison of the set versus the generalized median graph 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Bardaji Goikoetxea, Itziar; Bunke, Horst (Springer Berlin / Heidelberg, 2009)
    Capítol de llibre
    Accés restringit per política de l'editorial
    In this paper we propose the application of the generalized median graph in a graph-based k-means clustering algorithm. In the graph-based k-means algorithm, the centers of the clusters have been traditionally represented ...
  • Median graph computation by means of a genetic approach based on minimum common supergraph and maximum common subraph 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc (Springer Berlin / Heidelberg, 2009)
    Capítol de llibre
    Accés restringit per política de l'editorial
    Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical ...
  • Median graph: a new exact algorithm using a distance based on the maximum common subgraph 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc (2009)
    Article
    Accés restringit per política de l'editorial
    Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more ...
  • Median graphs: a genetic approach based on new theoretical properties 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc (2009)
    Article
    Accés restringit per política de l'editorial
    Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical ...