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 52 matches
- 2016
- Luca Rossi, Simone Severini, Andrea Torsello:
The Average Mixing Matrix Signature. S+SSPR 2016: 474-484 - Furqan Aziz, Edwin R. Hancock, Richard C. Wilson:
Graph Entropy from Closed Walk and Cycle Functionals. S+SSPR 2016: 174-184 - Michal Balazia, Petr Sojka:
Walker-Independent Features for Gait Recognition from Motion Capture Data. S+SSPR 2016: 310-321 - Kevin Bascol, Rémi Emonet, Élisa Fromont, Jean-Marc Odobez:
Unsupervised Interpretable Pattern Discovery in Time Series Using Autoencoders. S+SSPR 2016: 427-438 - Mara Chinea-Rios, Germán Sanchis-Trilles, Francisco Casacuberta:
Bilingual Data Selection Using a Continuous Vector-Space Representation. S+SSPR 2016: 95-106 - Xavier Cortés, Francesc Serratosa, Kaspar Riesen:
On the Relevance of Local Neighbourhoods for Greedy Graph Edit Distance. S+SSPR 2016: 121-131 - Andrea Cucci, Pietro Lovato, Manuele Bicego:
Enriched Bag of Words for Protein Remote Homology Detection. S+SSPR 2016: 463-473 - Lixin Cui, Lu Bai, Yue Wang, Xiao Bai, Zhihong Zhang, Edwin R. Hancock:
P2P Lending Analysis Using the Most Relevant Graph-Based Features. S+SSPR 2016: 3-14 - Ambra Demontis, Paolo Russu, Battista Biggio, Giorgio Fumera, Fabio Roli:
On Security and Sparsity of Linear Classifiers for Adversarial Settings. S+SSPR 2016: 322-332 - Matteo Denitto, Luca Magri, Alessandro Farinelli, Andrea Fusiello, Manuele Bicego:
Multiple Structure Recovery via Probabilistic Biclustering. S+SSPR 2016: 274-284 - Romain Deville, Élisa Fromont, Baptiste Jeudy, Christine Solnon:
GriMa: A Grid Mining Algorithm for Bag-of-Grid-Based Classification. S+SSPR 2016: 132-142 - Sounak Dey, Anguelos Nicolaou, Josep Lladós, Umapada Pal:
Local Binary Pattern for Word Spotting in Handwritten Historical Document. S+SSPR 2016: 574-583 - Francisco Escolano, Manuel Curado, Edwin R. Hancock:
Commute Times in Dense Graphs. S+SSPR 2016: 241-251 - Francisco Escolano, Manuel Curado, Miguel Angel Lozano, Edwin R. Hancock:
Dirichlet Graph Densifiers. S+SSPR 2016: 185-195 - Jean Felipe Felsky, Edson J. R. Justino, Jacques Facon:
Forensic Analysis of Manuscript Authorship: An Optimized Computational Approach Based on Texture Descriptors. S+SSPR 2016: 357-367 - Damien Fourure, Rémi Emonet, Élisa Fromont, Damien Muselet, Alain Trémeau, Christian Wolf:
Semantic Segmentation via Multi-task, Multi-domain Learning. S+SSPR 2016: 333-343 - Pasi Fränti, Radu Mariescu-Istodor, Caiming Zhong:
XNN Graph. S+SSPR 2016: 207-217 - Pasi Fränti, Mohammad Rezaei:
Generalizing Centroid Index to Different Clustering Models. S+SSPR 2016: 285-296 - Aysylu Gabdulkhakova, Walter G. Kropatsch:
Detecting Ellipses in Elongated Shapes Using the Thickness Profile. S+SSPR 2016: 412-423 - Benoit Gaüzère, Sébastien Bougleux, Luc Brun:
Approximating Graph Edit Distance Using GNCCP. S+SSPR 2016: 496-506 - Aidin Hassanzadeh, Arto Kaarna, Tuomo Kauranne:
Outlier Robust Geodesic K-means Algorithm for High Dimensional Data. S+SSPR 2016: 252-262 - Hayato Itoh, Atsushi Imiya, Tomoya Sakai:
Mathematical Aspects of Tensor Subspace Method. S+SSPR 2016: 37-48 - Hayato Itoh, Atsushi Imiya, Tomoya Sakai:
Classification of Volumetric Data Using Multiway Data Analysis. S+SSPR 2016: 231-240 - Keigo Kimura, Mineichi Kudo, Lu Sun:
Simultaneous Nonlinear Label-Instance Embedding for Multi-label Classification. S+SSPR 2016: 15-25 - Satoru Koda:
Adaptive Sparse Bayesian Regression with Variational Inference for Parameter Estimation. S+SSPR 2016: 263-273 - Jesse H. Krijthe, Marco Loog:
The Peaking Phenomenon in Semi-supervised Learning. S+SSPR 2016: 299-309 - Bahram Lavi, Giorgio Fumera, Fabio Roli:
A Multi-Stage Approach for Fast Person Re-identification. S+SSPR 2016: 63-73 - Julien Lerouge, Zeina Abu-Aisheh, Romain Raveaux, Pierre Héroux, Sébastien Adam:
Exact Graph Edit Distance Computation Using a Binary Linear Program. S+SSPR 2016: 485-495 - Joshua Lockhart, Giorgia Minello, Luca Rossi, Simone Severini, Andrea Torsello:
Edge Centrality via the Holevo Quantity. S+SSPR 2016: 143-152 - Radu Mariescu-Istodor, Pasi Fränti:
Gesture Input for GPS Route Search. S+SSPR 2016: 439-449
skipping 22 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-11-24 03:14 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