Остановите войну!
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 39 matches
- 2011
- Ayan Acharya, Eduardo R. Hruschka, Joydeep Ghosh, Sreangsu Acharyya:
C 3E: A Framework for Combining Ensembles of Classifiers and Clusterers. MCS 2011: 269-278 - Davide Ariu, Giorgio Giacinto:
A Modular Architecture for the Analysis of HTTP Payloads Based on Multiple Classifiers. MCS 2011: 330-339 - Shai Avidan:
Ensemble Methods for Tracking and Segmentation (Abstract). MCS 2011: 1 - Muhammad Awais, Fei Yan, Krystian Mikolajczyk, Josef Kittler:
Two-Stage Augmented Kernel Matrix for Object Recognition. MCS 2011: 137-146 - Luana Batista, Eric Granger, Robert Sabourin:
Dynamic Ensemble Selection for Off-Line Signature Verification. MCS 2011: 157-166 - Miguel Ángel Bautista, Oriol Pujol, Xavier Baró, Sergio Escalera:
Introducing the Separability Matrix for Error Correcting Output Codes Coding. MCS 2011: 227-236 - Vladimir B. Berikov:
A Latent Variable Pairwise Classification Model of a Clustering Ensemble. MCS 2011: 279-288 - Yaxin Bi:
Analyzing the Relationship between Diversity and Evidential Fusion Accuracy. MCS 2011: 249-258 - Battista Biggio, Igino Corona, Giorgio Fumera, Giorgio Giacinto, Fabio Roli:
Bagging Classifiers for Fighting Poisoning Attacks in Adversarial Classification Tasks. MCS 2011: 350-359 - Pierluigi Casale, Oriol Pujol, Petia Radeva:
Approximate Convex Hulls Family for One-Class Classification. MCS 2011: 106-115 - Nicolò Cesa-Bianchi:
Ensembles and Multiple Classifiers: A Game-Theoretic View. MCS 2011: 2-5 - Veronika Cheplygina, David M. J. Tax:
Pruned Random Subspace Method for One-Class Classifiers. MCS 2011: 96-105 - János Csirik, Peter Bertholet, Horst Bunke:
Sequential Classifier Combination for Pattern Recognition in Wireless Sensor Networks. MCS 2011: 187-196 - Alberto Dainotti, Antonio Pescapè, Carlo Sansone, Antonio Quintavalle:
Using a Behaviour Knowledge Space Approach for Detecting Unknown IP Traffic Flows. MCS 2011: 360-369 - Nikolay Degtyarev, Oleg Seredin:
A Geometric Approach to Face Detector Combining. MCS 2011: 299-308 - José-Francisco Díez-Pastor, César Ignacio García-Osorio, Juan José Rodríguez, Andrés Bustillo:
GRASP Forest: A New Ensemble Method for Trees. MCS 2011: 66-75 - Stefan Faußer, Friedhelm Schwenker:
Ensemble Methods for Reinforcement Learning with Function Approximation. MCS 2011: 56-65 - Jaume Gibert, Ernest Valveny, Oriol Ramos Terrades, Horst Bunke:
Multiple Classifiers for Graph of Words Embedding. MCS 2011: 36-45 - Anna Jurek, Yaxin Bi, Shengli Wu, Chris D. Nugent:
Classification by Cluster Analysis: A New Meta-Learning Based Approach. MCS 2011: 259-268 - Wael Khreich, Eric Granger, Ali Miri, Robert Sabourin:
Incremental Boolean Combination of Classifiers. MCS 2011: 340-349 - Josef Kittler, Norman Poh, Amin Merati:
Cohort Based Approach to Multiexpert Class Verification. MCS 2011: 319-329 - Wan-Jui Lee, Robert P. W. Duin, Marco Loog:
Generalized Augmentation of Multiple Kernels. MCS 2011: 116-125 - Emanuela Marasco, Peter Johnson, Carlo Sansone, Stephanie A. C. Schuckers:
Increase the Security of Multibiometric Systems by Incorporating a Spoofing Detection Algorithm in the Fusion Mechanism. MCS 2011: 309-318 - Maxim Panov, Alexander Tatarchuk, Vadim Mottl, David Windridge:
A Modified Neutral Point Method for Kernel-Based Fusion of Pattern-Recognition Modalities with Incomplete Data Sets. MCS 2011: 126-136 - Yubin Park, Joydeep Ghosh:
Compact Ensemble Trees for Imbalanced Data. MCS 2011: 86-95 - Ignazio Pillai, Giorgio Fumera, Fabio Roli:
Classifier Selection Approaches for Multi-label Problems. MCS 2011: 167-176 - Moacir P. Ponti Jr., João P. Papa:
Improving Accuracy and Speed of Optimum-Path Forest Classifier Using Combination of Disjoint Training Subsets. MCS 2011: 237-248 - Eloi Puertas, Sergio Escalera, Oriol Pujol:
Multi-class Multi-scale Stacked Sequential Learning. MCS 2011: 197-206 - Maria Teresa Ricamato, Mario Molinara, Francesco Tortorella:
Selection Strategies for pAUC-Based Combination of Dichotomizers. MCS 2011: 177-186 - Juan José Rodríguez, José-Francisco Díez-Pastor, César Ignacio García-Osorio:
Ensembles of Decision Trees for Imbalanced Data. MCS 2011: 76-85
skipping 9 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-07-04 04:32 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