default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 83 matches
- 2012
- Luca Rossi, Andrea Torsello, Edwin R. Hancock:
Approximate Axial Symmetries from Continuous Time Quantum Walks. SSPR/SPR 2012: 144-152 - Karim T. Abou-Moustafa, Frank P. Ferrie:
Modified Divergences for Gaussian Densities. SSPR/SPR 2012: 426-436 - Laura Antanas, Paolo Frasconi, Fabrizio Costa, Tinne Tuytelaars, Luc De Raedt:
A Relational Kernel-Based Framework for Hierarchical Image Understanding. SSPR/SPR 2012: 171-180 - Hasitha Bimsara Ariyaratne, Dengsheng Zhang, Guojun Lu:
A Class Centric Feature and Classifier Ensemble Selection Approach for Music Genre Classification. SSPR/SPR 2012: 666-674 - Furqan Aziz, Richard C. Wilson, Edwin R. Hancock:
Shape Analysis Using the Edge-Based Laplacian. SSPR/SPR 2012: 382-390 - Lu Bai, Edwin R. Hancock:
Graph Complexity from the Jensen-Shannon Divergence. SSPR/SPR 2012: 79-88 - Lu Bai, Edwin R. Hancock, Peng Ren:
A Jensen-Shannon Kernel for Hypergraphs. SSPR/SPR 2012: 181-189 - Miguel Ángel Bautista, Sergio Escalera, Xavier Baró, Oriol Pujol:
A Genetic Inspired Optimization for ECOC. SSPR/SPR 2012: 743-751 - Battista Biggio, Giorgio Fumera, Fabio Roli, Luca Didaci:
Poisoning Adaptive Biometric Systems. SSPR/SPR 2012: 417-425 - Ehsan Zare Borzeshi, Óscar Pérez Concha, Massimo Piccardi:
Human Action Recognition in Video by Fusion of Structural and Spatio-temporal Features. SSPR/SPR 2012: 474-482 - Sébastien Bougleux, François-Xavier Dupé, Luc Brun, Myriam Mokhtari:
Shape Similarity Based on a Treelet Kernel with Edition. SSPR/SPR 2012: 199-207 - Klaus Broelemann, Anjan Dutta, Xiaoyi Jiang, Josep Lladós:
Hierarchical Graph Representation for Symbol Spotting in Graphical Document Images. SSPR/SPR 2012: 529-538 - Gulcan Can, Orhan Firat, Fatos Tünay Yarman Vural:
Conditional Random Fields for Land Use/Land Cover Classification and Complex Region Detection. SSPR/SPR 2012: 216-224 - Yie-Tarng Chen, You-Rong Lin, Wen-Hsien Fang:
A Novel Shadow-Assistant Human Fall Detection Scheme Using a Cascade of SVM Classifiers. SSPR/SPR 2012: 710-718 - Veronika Cheplygina, David M. J. Tax, Marco Loog:
Class-Dependent Dissimilarity Measures for Multiple Instance Learning. SSPR/SPR 2012: 602-610 - James S. Cope, Paolo Remagnino:
Classification of High-Dimension PDFs Using the Hungarian Algorithm. SSPR/SPR 2012: 727-733 - Xavier Cortés, Francesc Serratosa, Albert Solé-Ribalta:
Active Graph Matching Based on Pairwise Probabilities between Nodes. SSPR/SPR 2012: 98-106 - Davide Cozzolino, Giovanni Poggi, Carlo Sansone, Luisa Verdoliva:
A Comparative Analysis of Forgery Detection Algorithms. SSPR/SPR 2012: 693-700 - Roberto D'Ambrosio, Paolo Soda:
Polichotomies on Imbalanced Domains by One-per-Class Compensated Reconstruction Rule. SSPR/SPR 2012: 301-309 - Chesner Désir, Simon Bernard, Caroline Petitjean, Laurent Heutte:
A New Random Forest Method for One-Class Classification. SSPR/SPR 2012: 282-290 - Luca Didaci, Giorgio Fumera, Fabio Roli:
Analysis of Co-training Algorithm with Very Small Training Sets. SSPR/SPR 2012: 719-726 - Fadi Dornaika, Ammar Assoum, Bogdan Raducanu:
Automatic Dimensionality Estimation for Manifold Learning through Optimal Feature Selection. SSPR/SPR 2012: 575-583 - Robert P. W. Duin, Ana L. N. Fred, Marco Loog, Elzbieta Pekalska:
Mode Seeking Clustering by KNN and Mean Shift Evaluated. SSPR/SPR 2012: 51-59 - Francisco Escolano, Boyan Bonev, Edwin R. Hancock:
Heat Flow-Thermodynamic Depth Complexity in Directed Networks. SSPR/SPR 2012: 190-198 - Aasa Feragen:
Complexity of Computing Distances between Geometric Trees. SSPR/SPR 2012: 89-97 - Lucas Franek, Xiaoyi Jiang:
Evolutionary Weighted Mean Based Framework for Generalized Median Computation with Application to Strings. SSPR/SPR 2012: 70-78 - Volkmar Frinken, Alicia Fornés, Josep Lladós, Jean-Marc Ogier:
Bidirectional Language Model for Handwriting Recognition. SSPR/SPR 2012: 611-619 - Zhouyu Fu, Guojun Lu, Kai Ming Ting, Dengsheng Zhang:
Learning Sparse Kernel Classifiers in the Primal. SSPR/SPR 2012: 60-69 - Roberta Fusco, Mario Sansone, Antonella Petrillo, Carlo Sansone:
A Multiple Classifier System for Classification of Breast Lesions Using Dynamic and Morphological Features in DCE-MRI. SSPR/SPR 2012: 684-692 - Benoit Gaüzère, Luc Brun, Didier Villemin:
Graph Kernels: Crossing Information from Different Patterns Using Graph Edit Distance. SSPR/SPR 2012: 42-50
skipping 53 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-12-22 03:15 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint