Остановите войну!
for scientists:
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 16 matches
- 2020
- Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel:
Efficient k-nearest neighbors search in graph space. Pattern Recognit. Lett. 134: 77-86 (2020) - Lu Bai, Lixin Cui, Luca Rossi, Lixiang Xu, Xiao Bai, Edwin R. Hancock:
Local-global nested graph kernels using nested complexity traces. Pattern Recognit. Lett. 134: 87-95 (2020) - David B. Blumenthal, Johann Gamper:
On the exact computation of the graph edit distance. Pattern Recognit. Lett. 134: 46-57 (2020) - Sébastien Bougleux, Benoit Gaüzère, David B. Blumenthal, Luc Brun:
Fast linear sum assignment with error-correction and no cost constraints. Pattern Recognit. Lett. 134: 37-45 (2020) - Luc Brun, Pasquale Foggia, Mario Vento:
Trends in graph-based representations for Pattern Recognition. Pattern Recognit. Lett. 134: 3-9 (2020) - Vincenzo Carletti, Pasquale Foggia, Antonio Greco, Alessia Saggese, Mario Vento:
Comparing performance of graph matching algorithms on huge graphs. Pattern Recognit. Lett. 134: 58-67 (2020) - Mostafa Darwiche, Donatello Conte, Romain Raveaux, Vincent T'kindt:
Graph edit distance: Accuracy of local branching from an application point of view. Pattern Recognit. Lett. 134: 20-28 (2020) - Pasquale Foggia, Mario Vento, Cheng-Lin Liu:
Special issue on "Applications of graph-based techniques to pattern recognition". Pattern Recognit. Lett. 134: 1-2 (2020) - Maxime Martineau, Romain Raveaux, Donatello Conte, Gilles Venturini:
Learning error-correcting graph matching with a multiclass neural network. Pattern Recognit. Lett. 134: 68-76 (2020) - Carlos Francisco Moreno-García, Francesc Serratosa, Xiaoyi Jiang:
Correspondence edit distance to obtain a set of weighted means of graph correspondences. Pattern Recognit. Lett. 134: 29-36 (2020) - Pau Riba, Josep Lladós, Alicia Fornés:
Hierarchical graphs for coarse-to-fine error tolerant matching. Pattern Recognit. Lett. 134: 116-124 (2020) - Pep Santacruz, Francesc Serratosa:
Error-tolerant graph matching in linear computational cost using an initial small partial matching. Pattern Recognit. Lett. 134: 10-19 (2020) - Michael Stauffer, Andreas Fischer, Kaspar Riesen:
Filters for graph-based keyword spotting in historical handwritten documents. Pattern Recognit. Lett. 134: 125-134 (2020) - Sebastiano Vascon, Marco Frasca, Rocco Tripodi, Giorgio Valentini, Marcello Pelillo:
Protein function prediction as a graph-transduction game. Pattern Recognit. Lett. 134: 96-105 (2020) - Jianjia Wang, Richard C. Wilson, Edwin R. Hancock:
Directed and undirected network evolution from Euler-Lagrange dynamics. Pattern Recognit. Lett. 134: 135-144 (2020) - Guobao Xiao, Xiong Zhou, Yan Yan, Hanzi Wang:
A two-step hypergraph reduction based fitting method for unbalanced data. Pattern Recognit. Lett. 134: 106-115 (2020)
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-08-27 03:04 CEST 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