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 48 matches
- 2010
- Eya Ben Ahmed:
Incremental Update of Cyclic Association Rules. IDEAL 2010: 387-395 - Lukás Bajer, Martin Holena:
Surrogate Model for Continuous and Discrete Genetic Optimization Based on RBF Networks. IDEAL 2010: 251-258 - Li-Jen Chien, Yuh-Jye Lee, Zhi-Peng Kao, Chih-Cheng Chang:
Robust 1-Norm Soft Margin Smooth Support Vector Machine. IDEAL 2010: 145-152 - Marcin Ciecholewski:
Gallbladder Boundary Segmentation from Ultrasound Images Using Active Contour Model. IDEAL 2010: 63-69 - Clinton Cohagan, Jerzy W. Grzymala-Busse, Zdzislaw S. Hippe:
A Comparison of Three Voting Methods for Bagging with the MLEM2 Algorithm. IDEAL 2010: 118-125 - José Alfredo F. Costa:
Clustering and Visualizing SOM Results. IDEAL 2010: 334-343 - Luke Dicken, John Levine:
Applying Clustering Techniques to Reduce Complexity in Automated Planning Domains. IDEAL 2010: 186-193 - Carsten Elfers, Mirko Horstmann, Karsten Sohr, Otthein Herzog:
Typed Linear Chain Conditional Random Fields and Their Application to Intrusion Detection. IDEAL 2010: 13-20 - Mohamed Amir Esseghir, Gilles Goncalves, Yahya Slimani:
Adaptive Particle Swarm Optimizer for Feature Selection. IDEAL 2010: 226-233 - Marisa B. Figueiredo, Ana de Almeida, Bernardete Ribeiro, António Martins:
Extracting Features from an Electrical Signal of a Non-Intrusive Load Monitoring System. IDEAL 2010: 210-217 - Yu Fujimoto, Noboru Murata:
A Generalization of Independence in Naive Bayes Model. IDEAL 2010: 153-161 - Marcin Gorawski, Slawomir Bankowski, Michal Gorawski:
Selection of Structures with Grid Optimization, in Multiagent Data Warehouse. IDEAL 2010: 292-299 - Ana Granados, Rafael Martínez, David Camacho, Francisco de Borja Rodríguez:
Relevance of Contextual Information in Compression-Based Text Clustering. IDEAL 2010: 259-266 - Maciej Grzenda, Deepak Thukral:
An Efficient Approach to Clustering Real-Estate Listings. IDEAL 2010: 379-386 - Andrea Guidali, Elisabetta Binaghi, Mauro Guglielmin, Marco Pascale:
Investigating the Behaviour of Radial Basis Function Networks in Regression and Classification of Geospatial Data. IDEAL 2010: 110-117 - Aida de Haro-García, Juan Antonio Romero del Castillo, Nicolás García-Pedrajas:
Large Scale Instance Selection by Means of a Parallel Algorithm. IDEAL 2010: 1-12 - Naohiro Ishii, Yuichi Morioka, Hiroaki Kimura, Yongguang Bao:
Classification by Multiple Reducts-kNN with Confidence. IDEAL 2010: 94-101 - Vilen Jumutc, Pawel Zayakin:
On the Power of Topological Kernel in Microarray-Based Detection of Cancer. IDEAL 2010: 70-77 - Mohammad Ali Kadampur, Durvasula V. L. N. Somayajulu:
Privacy Preserving Technique for Euclidean Distance Based Mining Algorithms Using a Wavelet Related Transform. IDEAL 2010: 202-209 - Hisashi Koga, Tsuji Tomokazu, Takanori Yokoyama, Toshinori Watanabe:
New Application of Graph Mining to Video Analysis. IDEAL 2010: 86-93 - Marzena Kryszkiewicz, Piotr Lasek:
A Neighborhood-Based Clustering by Means of the Triangle Inequality. IDEAL 2010: 284-291 - Xinyang Li, Andreas Krause:
An Evolutionary Multi-objective Optimization of Market Structures Using PBIL. IDEAL 2010: 78-85 - Piotr Lipinski:
A Hybrid Evolutionary Algorithm to Quadratic Three-Dimensional Assignment Problem with Local Search for Many-Core Graphics Processors. IDEAL 2010: 344-351 - Piotr Lipinski:
Evolution Strategies for Objective Functions with Locally Correlated Variables. IDEAL 2010: 352-359 - Noel Lopes, Bernardete Ribeiro:
Non-negative Matrix Factorization Implementation Using Graphic Processing Units. IDEAL 2010: 275-283 - Jorge Loureiro, Orlando Belo:
The M-OLAP Cube Selection Problem: A Hyper-polymorphic Algorithm Approach. IDEAL 2010: 194-201 - Malik Magdon-Ismail, Jonathan T. Purnell:
Approximating the Covariance Matrix of GMMs with Low-Rank Perturbations. IDEAL 2010: 300-307 - Zareen Mehboob, Hujun Yin:
Neural Data Analysis and Reduction Using Improved Framework of Information-Preserving EMD. IDEAL 2010: 360-367 - Shonique L. Miller, Gary L. Lebby, Ali R. Osareh:
Improving the Performance of the Truncated Fourier Series Least Squares (TFSLS)Power System Load Model Using an Artificial Neural Network Paradigm. IDEAL 2010: 368-378 - Kazuteru Miyazaki:
The Penalty Avoiding Rational Policy Making Algorithm in Continuous Action Spaces. IDEAL 2010: 178-185
skipping 18 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-28 21:37 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