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 93 matches
- 2000
- Naoto Abe, Mineichi Kudo, Jun Toyama, Masaru Shimbo:
A Divergence Criterion for Classifier-Independent Feature Selection. SSPR/SPR 2000: 668-676 - Sébastien Adam, Jean-Marc Ogier, Claude Cariou, Rémy Mullot, Joël Gardes, Jacques Labiche:
Character Recognition, Orientation, and Scale Estimation Thanks to the Fourier Mellin Transform. SSPR/SPR 2000: 472-481 - Giovanni Adorni, Stefano Cagnoni, Marco Gori:
Adaptive Graphical Pattern Recognition Beyond Connectionist-Based Approaches. SSPR/SPR 2000: 17-27 - Alireza Ahmadyfard, Josef Kittler:
Region-Based Representation for Object Recognition by Relaxation Labelling. SSPR/SPR 2000: 297-307 - René Alquézar, Francesc Serratosa, Alberto Sanfeliu:
Distance between Attributed Graphs and Function-Described Graphs Relaxing 2nd Order Restrictions. SSPR/SPR 2000: 277-286 - Gabriella Sanniti di Baja, Stina Svensson:
Surface Skeletons Detected on the D6 Distance Transform. SSPR/SPR 2000: 387-396 - Ricardo Barandela, Eduardo Gasca:
Decontamination of Training Samples for Supervised Pattern Recognition Methods. SSPR/SPR 2000: 621-630 - Dolores Barrios Rolanía, Daniel Manrique, Jaime Porras, Juan Rios:
Real-Coded Genetic Algorithms Based on Mathematical Morphology. SSPR/SPR 2000: 706-715 - Christian Bauckhage, Susanne Kronenberg, Franz Kummert, Gerhard Sagerer:
Grammars and Discourse Theory to Describe and Recognize Mechanical Assemblies. SSPR/SPR 2000: 173-182 - Paolo Bergamini, Luigi Cinque, Andrew D. J. Cross, Edwin R. Hancock, Stefano Levialdi, Richard Myers:
Efficient Alignment and Correspondence Using Edit Distance. SSPR/SPR 2000: 246-255 - James C. Bezdek, Ludmila Kuncheva:
Some Notes on Twenty One (21) Nearest Prototype Classifiers. SSPR/SPR 2000: 1-16 - Bir Bhanu, Yingqiang Lin:
Stochastic Models for Recognition of Occluded Objects. SSPR/SPR 2000: 560-570 - Walter F. Bischof, Terry Caelli:
Parallel Techniques for Rule-Based Scene Interpretation. SSPR/SPR 2000: 318-326 - Luc Brun, Walter G. Kropatsch:
Irregular Pyramids with Combinatorial Maps. SSPR/SPR 2000: 256-265 - Terry Caelli:
Shape Boundary Tracking with Hidden Markov Models. SSPR/SPR 2000: 308-317 - Sung-Hyuk Cha, Sargur N. Srihari:
Writer Identification: Statistical Analysis and Dichotomizer. SSPR/SPR 2000: 123-132 - Dechang Chen, Xiuzhen Cheng:
A Simple Implementation of the Stochastic Discrimination for Pattern Recognition. SSPR/SPR 2000: 882-887 - Se-Ho Choi, Peter I. Rockett:
Reducing the Training Times of Neural Classifiers with Dataset Condensing. SSPR/SPR 2000: 650-657 - Keith Copsey, Andrew Webb:
Bayesian Approach to Mixture Models for Discrimination. SSPR/SPR 2000: 491-500 - Laura Davlea:
A Structural Matching Algorithm Using Generalized Deterministic Annealing. SSPR/SPR 2000: 221-225 - Yasser El-Sonbaty, Mohamed A. Ismail:
A New Error-Correcting Distance for Attributed Relational Graph Problems. SSPR/SPR 2000: 266-276 - Boris Flach, Michail I. Schlesinger:
A Class of Solvable Consistent Labeling Problems. SSPR/SPR 2000: 462-471 - Pasquale Foggia, Roberto Genna, Mario Vento:
Prototype Learning with Attributed Relational Graphs. SSPR/SPR 2000: 447-456 - Mikel L. Forcada, Rafael C. Carrasco:
Encoding Nondeterministic Finite-State Tree Automata in Sigmoid Recursive Neural Networks. SSPR/SPR 2000: 203-210 - Ana L. N. Fred, José M. N. Leitão:
Partitional vs Hierarchical Clustering Using a Minimum Grammar Complexity Approach. SSPR/SPR 2000: 193-202 - Rudolf Freund, Markus Neubauer, Martin Summerer, Stefan Gruber, Jürgen Schaffer, Roland Swoboda:
A Hybrid System for the Recognition of Hand-Written Characters. SSPR/SPR 2000: 67-76 - Frank Fuchs, Hervé Le Men:
Efficient Subgraph Isomorphism with 'A Priori' Knowledge (Application to 3D Reconstruction of Buildings for Cartography). SSPR/SPR 2000: 427-436 - Giorgio Fumera, Fabio Roli, Giorgio Giacinto:
Multiple Reject Thresholds for Improving Classification Reliability. SSPR/SPR 2000: 863-871 - Pedro L. Galindo, Joaquín Pizarro Junquera, Elisa Guerrero Vázquez:
Multiple Comparison Procedures for Determining the Optimal Complexity of a Model. SSPR/SPR 2000: 796-805 - Jiang Gao, Xiaoqing Ding, Jing Zheng:
Image Pattern Recognition Based on Examples - A Combined Statistical and Structural-Syntactic Approach. SSPR/SPR 2000: 57-66
skipping 63 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-09-18 23:31 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