2008 |
14 | EE | Francisco Escolano,
Edwin R. Hancock,
Miguel Angel Lozano:
Birkhoff polytopes, heat kernels and graph complexity.
ICPR 2008: 1-5 |
13 | EE | Francisco Escolano,
Edwin R. Hancock,
Miguel Angel Lozano:
Polytopal Graph Complexity, Matrix Permanents, and Embedding.
SSPR/SPR 2008: 237-246 |
2007 |
12 | EE | Wendy Aguilar,
M. Elena Martínez-Pérez,
Yann Frauel,
Francisco Escolano,
Miguel Angel Lozano,
Arturo Espinosa-Romero:
Graph-Based Methods for Retinal Mosaicing and Vascular Characterization.
GbRPR 2007: 25-36 |
11 | EE | Boyan Bonev,
Francisco Escolano,
Miguel Angel Lozano,
Pablo Suau,
Miguel Cazorla,
Wendy Aguilar:
Constellations and the Unsupervised Learning of Graphs.
GbRPR 2007: 340-350 |
2006 |
10 | EE | Miguel Angel Lozano,
Francisco Escolano:
Protein classification by matching and clustering surface graphs.
Pattern Recognition 39(4): 539-551 (2006) |
2005 |
9 | EE | Miguel Angel Lozano,
Francisco Escolano:
Protein Classification with Kernelized Softassign.
GbRPR 2005: 332-341 |
8 | EE | Miguel Angel Lozano,
Francisco Escolano:
Local Entropic Graphs for Globally-Consistent Graph Matching.
GbRPR 2005: 342-351 |
2004 |
7 | EE | Miguel Angel Lozano,
Francisco Escolano:
Regularization Kernels and Softassign.
CIARP 2004: 320-327 |
6 | EE | Miguel Angel Lozano,
Francisco Escolano:
Structural Recognition with Kernelized Softassign.
IBERAMIA 2004: 626-635 |
5 | EE | Miguel Angel Lozano,
Francisco Escolano:
A Significant Improvement of Softassign with Diffusion Kernels.
SSPR/SPR 2004: 76-84 |
2003 |
4 | EE | Miguel Angel Lozano,
Francisco Escolano:
Two New Scale-Adapted Texture Descriptors for Image Segmentation.
CIARP 2003: 137-144 |
3 | EE | Miguel Angel Lozano,
Francisco Escolano:
EM Algorithm for Clustering an Ensemble of Graphs with Comb Matching.
EMMCVPR 2003: 52-67 |
2 | EE | Miguel Angel Lozano,
Francisco Escolano:
ACM Attributed Graph Clustering for Learning Classes of Images.
GbRPR 2003: 247-258 |
2002 |
1 | EE | Miguel Angel Lozano,
Francisco Escolano:
Recognizing Indoor Images with Unsupervised Segmentation and Graph Matching.
IBERAMIA 2002: 933-942 |