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 488 matches
- 2024
- Bethany Austhof, Lev Reyzin:
A Model for Optimizing Recalculation Schedules to Minimize Regret. ISAIM 2024: 1-9 - Pranjal Awasthi, Corinna Cortes, Yishay Mansour, Mehryar Mohri:
A Theory of Learning with Competing Objectives and User Feedback. ISAIM 2024: 10-49 - Samuel Bounan, Stefan Edelkamp:
Trick Costs for α μ and New Relatives. ISAIM 2024: 50-67 - Allen Van Gelder:
Partial Boolean Functions for QBF Semantics. ISAIM 2024: 236-253 - Philippe Jégou:
Extending the Tractability of the Clique Problem via Graph Classes Generalizing Treewidth. ISAIM 2024: 94-106 - Sangram Kishor Jena, K. Subramani, Alvaro Velasquez:
A Differential Approach for Several NP-hard Optimization Problems. ISAIM 2024: 68-80 - Anukul Maity, Mousumi Dutt, Arindam Biswas:
Finding the Straight Skeleton for 3D Orthogonal Polyhedrons: A Combinatorial Approach. ISAIM 2024: 206-217 - Anqi Mao, Mehryar Mohri, Yutao Zhong:
Principled Approaches for Learning to Defer with Multiple Experts. ISAIM 2024: 107-135 - Csaba Olasz:
Addressing Discretization Artifacts in Tomography by Accessing and Balancing Pixel Coverage of Projections. ISAIM 2024: 182-205 - Lev Reyzin, Duan Tu:
On Sample Reuse Methods for Answering k-wise Statistical Queries. ISAIM 2024: 136-149 - Ryusei Shingaki, Manabu Kuroki:
New Proportion Measures of Discrimination Based on Natural Direct and Indirect Effects. ISAIM 2024: 165-181 - K. Subramani, Piotr Wojciechowski:
On the Computational Complexities of Finding Selected Refutations of Linear Programs. ISAIM 2024: 81-93 - Benjamin Uhrich, Tim Häntschel, Martin Schäfer, Erhard Rahm:
Neural Diffusion Graph Convolutional Network for Predicting Heat Transfer in Selective Laser Melting. ISAIM 2024: 150-164 - Linde Vanbesien, Samuele Pollaci, Bart Bogaerts, Marc Denecker:
Towards a Unifying View on Monotone Constructive Definitions. ISAIM 2024: 218-235 - Reneta P. Barneva, Valentin E. Brimkov, Claudio Gentile, Aldo Pacchiano:
Artificial Intelligence and Image Analysis - 18th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2024, and 22nd International Workshop on Combinatorial Image Analysis, IWCIA 2024, Fort Lauderdale, FL, USA, January 8-10, 2024, Revised Selected Papers. Lecture Notes in Computer Science 14494, Springer 2024, ISBN 978-3-031-63734-6 [contents] - 2022
- Christian Addington, Jacob Schlueter, Judy Goldsmith:
The Power of Symmetry for Nash Stable Additively Separable Hedonic Games. ISAIM 2022 - Alessandro Agnetis, Mario Benini, Paolo Detti, Marco Pranzo, Ben Hermans:
Replication and sequencing of unreliable jobs on parallel machines. ISAIM 2022 - S. Annadurai, T. T. Raman, T. Kalyani, D. Gnanaraj Thomas, P. Ravichandran:
Pasting Systems with Picture Tiles Yielding Interesting Patterns. ISAIM 2022 - Jesús Aransay, Laureano Lambán, Julius Michaelis, Julio Rubio:
Formalizing Alexander duality through BDDs. ISAIM 2022 - Nathan Arnold, Sarah H. Snider, Judy Goldsmith:
Extensions on Tiered Coalition Formation Games. ISAIM 2022 - Aydin Avkan, Benedek Nagy, Müge Saadetoglu:
A Comparison of 2D Regular Grids based on Digital Continuity of Rotations. ISAIM 2022 - Jagadish Bapanapally, Ruben Gamboa:
A Formal Proof of the Banach-Tarski Theorem in ACL2(r). ISAIM 2022 - Sihem Belabbes, Salem Benferhat:
Revisiting Partially Preordered Possibilistic DL-Lite – An Extended Abstract. ISAIM 2022 - Guy Blanc, Jane Lange:
Properly learning decision trees in almost polynomial time. ISAIM 2022 - Endre Boros, Joonhee Lee:
Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions. ISAIM 2022 - Claude Carlet:
Parameterization of Boolean functions by vectorial functions and associated constructions. ISAIM 2022 - Arianna Casanova, Enrique Miranda, Marco Zaffalon:
Joint Desirability Foundations of Social Choice and Opinion Pooling. ISAIM 2022 - Bugra Çaskurlu, Fatih Erdem Kizilkaya, Berkehan Ozen:
Hedonic Expertise Games. ISAIM 2022 - Ondrej Cepek, James Weigle:
A Direct Equivalence-Testing Algorithm for SLRs. ISAIM 2022 - Yuxin Chen:
Optimizing Decision Making via Submodular Surrogates. ISAIM 2022
skipping 458 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-10-13 21:26 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