Остановите войну!
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 81 matches
- 2001
- Robert A. Amar, Daniel R. Dooly, Sally A. Goldman, Qi Zhang:
Multiple-Instance Learning of Real-Valued Data. ICML 2001: 3-10 - Hendrik Blockeel, Jan Struyf:
Efficient algorithms for decision tree cross-validation. ICML 2001: 11-18 - Avrim Blum, Shuchi Chawla:
Learning from Labeled and Unlabeled Data using Graph Mincuts. ICML 2001: 19-26 - Michael H. Bowling, Manuela M. Veloso:
Convergence of Gradient Dynamics with a Variable Learning Rate. ICML 2001: 27-34 - Urszula Chajewska, Daphne Koller, Dirk Ormoneit:
Learning an Agent's Utility Function by Observing Behavior. ICML 2001: 35-42 - David Choi, Benjamin Van Roy:
A Generalized Kalman Filter for Fixed Point Approximation and Efficient Temporal Difference Learning. ICML 2001: 43-50 - Wei Chu, S. Sathiya Keerthi, Chong Jin Ong:
A Unified Loss Function in Bayesian Framework for Support Vector Regression. ICML 2001: 51-58 - Craig W. Codrington:
Boosting with Confidence Information. ICML 2001: 59-65 - Nello Cristianini, John Shawe-Taylor, Huma Lodhi:
Latent Semantic Kernels. ICML 2001: 66-73 - Sanmay Das:
Filters, Wrappers and a Boosting-Based Hybrid for Feature Selection. ICML 2001: 74-81 - Richard Dearden:
Structured Prioritised Sweeping. ICML 2001: 82-89 - Alin Dobra, Johannes Gehrke:
Bias Correction in Classification Tree Construction. ICML 2001: 90-97 - Carlotta Domeniconi, Dimitrios Gunopulos:
An Efficient Approach for Approximating Multi-dimensional Range Queries and Nearest Neighbor Classification in Large Datasets. ICML 2001: 98-105 - Pedro M. Domingos, Geoff Hulten:
A General Method for Scaling Up Machine Learning Algorithms and its Application to Clustering. ICML 2001: 106-113 - Melissa Dominguez, Robert A. Jacobs:
Visual Development and the Acquisition of Binocular Disparity Sensitivities. ICML 2001: 114-121 - Harris Drucker, Behzad Shahraray, David C. Gibbon:
Relevance Feedback using Support Vector Machines. ICML 2001: 122-129 - Tina Eliassi-Rad, Jude W. Shavlik:
A Theory-Refinement Approach to Information Extraction. ICML 2001: 130-137 - Yaakov Engel, Shie Mannor:
Learning Embedded Maps of Markov Processes. ICML 2001: 138-145 - Johannes Fürnkranz:
Round Robin Rule Learning. ICML 2001: 146-153 - Thomas Gärtner, Peter A. Flach:
WBCsvm: Weighted Bayesian Classification based on Support Vector Machines. ICML 2001: 154-161 - Peter Geibel:
Reinforcement Learning with Bounded Risk. ICML 2001: 162-169 - Lise Getoor, Nir Friedman, Daphne Koller, Benjamin Taskar:
Learning Probabilistic Models of Relational Structure. ICML 2001: 170-177 - Rayid Ghani, Seán Slattery, Yiming Yang:
Hypertext Categorization using Hyperlink Patterns and Meta Data. ICML 2001: 178-185 - Mohammad Ghavamzadeh, Sridhar Mahadevan:
Continuous-Time Hierarchical Reinforcement Learning. ICML 2001: 186-193 - Matthew R. Glickman, Katia P. Sycara:
Evolutionary Search, Stochastic Policies with Memory, and Reinforcement Learning with Hidden State. ICML 2001: 194-201 - Greg Hamerly, Charles Elkan:
Bayesian approaches to failure prediction for disk drives. ICML 2001: 202-209 - Marcus Hutter:
General Loss Bounds for Universal Sequence Prediction. ICML 2001: 210-217 - Yuri A. Ivanov, Bruce Blumberg, Alex Pentland:
Expectation Maximization for Weakly Labeled Data. ICML 2001: 218-225 - Amir Jafari, Amy Greenwald, David Gondek, Gunes Ercal:
On No-Regret Learning, Fictitious Play, and Nash Equilibrium. ICML 2001: 226-233 - Wenxin Jiang:
Some Theoretical Aspects of Boosting in the Presence of Noisy Data. ICML 2001: 234-241
skipping 51 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-06-20 19:51 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