default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Kuhn
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with the same name
- Daniel Kuhn 0001
![[0000-0003-2697-8886]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-2697-8886")
— EPFL, Lausanne, Switzerland
Other persons with a similar name
- Daniel Kühn
- Daniel M. Kuhn
- Daniel Matheus Kuhn
- Fabian Kuhn (aka: Fabian Daniel Kuhn) — University of Freiburg, Germany
- Lukas Daniel Kuhn
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Andrew Rusinko III, Mohammad A. Rezaei, Lukas Friedrich, Hans-Peter Buchstaller, Daniel Kuhn, Ashwini Ghogare:
AIDDISON: Empowering Drug Discovery with AI/ML and CADD Tools in a Secure, Web-Based SaaS Platform. J. Chem. Inf. Model. 64(1): 3-8 (2024)- [c11]Beatriz Soviero, Daniel Kuhn, Alexandre Salle, Viviane Pereira Moreira:
ChatGPT Goes Shopping: LLMs Can Predict Relevance in eCommerce Search. ECIR (4) 2024: 3-11 - 2023
- [j18]Davide Boldini, Francesca Grisoni, Daniel Kuhn, Lukas Friedrich, Stephan A. Sieber:
Practical guidelines for the use of gradient boosting for molecular property prediction. J. Cheminformatics 15(1): 73 (2023) - [c10]Johannes Schimunek, Philipp Seidl, Lukas Friedrich, Daniel Kuhn, Friedrich Rippmann, Sepp Hochreiter, Günter Klambauer:
Context-enriched molecule representations improve few-shot drug discovery. ICLR 2023 - [i2]Johannes Schimunek, Philipp Seidl, Lukas Friedrich, Daniel Kuhn, Friedrich Rippmann, Sepp Hochreiter, Günter Klambauer:
Context-enriched molecule representations improve few-shot drug discovery. CoRR abs/2305.09481 (2023) - 2022
- [j17]Davide Boldini, Lukas Friedrich, Daniel Kuhn, Stephan A. Sieber:
Tuning gradient boosting for imbalanced bioassay modelling with custom loss functions. J. Cheminformatics 14(1): 80 (2022) - 2020
- [j16]Christina E. M. Schindler, Hannah M. Baumann, Andreas Blum, Dietrich Böse, Hans-Peter Buchstaller, Lars Burgdorf, Daniel Cappel, Eugene Chekler, Paul Czodrowski, Dieter Dorsch, Merveille K. I. Eguida, Bruce Follows, Thomas Fuchß, Ulrich Grädler, Jakub Gunera, Theresa Johnson, Catherine Jorand Lebrun, Srinivasa Karra, Markus Klein, Tim Knehans, Lisa Koetzner, Mireille Krier, Matthias Leiendecker, Birgitta Leuthner, Liwei Li, Igor Mochalkin, Djordje Musil, Constantin Neagu, Friedrich Rippmann, Kai Schiemann, Robert Schulz, Thomas Steinbrecher, Eva-Maria Tanzer, Andrea Unzue Lopez, Ariele Viacava Follis, Ansgar Wegener, Daniel Kuhn:
Large-Scale Assessment of Binding Free Energy Calculations in Active Drug Discovery Projects. J. Chem. Inf. Model. 60(11): 5457-5474 (2020)
2010 – 2019
- 2019
- [i1]Ekaterina Abramova, Luke Dickens, Daniel Kuhn, Aldo Faisal:
RLOC: Neurobiologically Inspired Hierarchical Reinforcement Learning Algorithm for Continuous Control of Nonlinear Dynamical Systems. CoRR abs/1903.03064 (2019) - 2018
- [j15]Christina E. M. Schindler, Friedrich Rippmann, Daniel Kuhn:
Relative binding affinity prediction of farnesoid X receptor in the D3R Grand Challenge 2 using FEP+. J. Comput. Aided Mol. Des. 32(1): 265-272 (2018) - [j14]Ihsan Yanikoglu, Daniel Kuhn:
Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs. SIAM J. Optim. 28(1): 198-222 (2018) - 2014
- [c9]Axel Kalenborn, Daniel Kuhn, Fabian Lorig:
Calculating Software Projects on a Mockup based approach. REFSQ Workshops 2014: 34-39 - 2013
- [j13]Paula Rocha, Daniel Kuhn:
A Polynomial-Time Solution Scheme for Quadratic Stochastic Programs. J. Optim. Theory Appl. 158(2): 576-589 (2013) - 2012
- [j12]Andrea Volkamer, Daniel Kuhn, Friedrich Rippmann, Matthias Rarey:
DoGSiteScorer: a web server for automatic binding site prediction, analysis and druggability assessment. Bioinform. 28(15): 2074-2075 (2012) - [j11]Ronald Hochreiter, Daniel Kuhn:
Optimal decision making under uncertainty. Comput. Manag. Sci. 9(1): 1-2 (2012) - [j10]Paula Rocha, Daniel Kuhn:
Multistage stochastic portfolio optimisation in deregulated electricity markets using linear decision rules. Eur. J. Oper. Res. 216(2): 397-408 (2012) - [j9]Andrea Volkamer, Daniel Kuhn, Thomas Grombacher, Friedrich Rippmann, Matthias Rarey:
Combining Global and Local Measures for Structure-Based Druggability Predictions. J. Chem. Inf. Model. 52(2): 360-372 (2012) - [j8]Dimitra Bampou, Daniel Kuhn:
Polynomial Approximations for Continuous Linear Programs. SIAM J. Optim. 22(2): 628-648 (2012) - 2011
- [j7]Daniel Kuhn:
Preface. Comput. Manag. Sci. 8(1-2): 1-2 (2011) - [j6]Michael J. Hadjiyiannis, Paul J. Goulart, Daniel Kuhn:
An Efficient Method to Estimate the Suboptimality of Affine Controllers. IEEE Trans. Autom. Control. 56(12): 2841-2853 (2011) - [c8]Michael J. Hadjiyiannis, Paul J. Goulart, Daniel Kuhn:
A scenario approach for estimating the suboptimality of linear decision rules in two-stage robust optimization. CDC/ECC 2011: 7386-7391 - [c7]Dimitra Bampou, Daniel Kuhn:
Scenario-free stochastic programming with polynomial decision rules. CDC/ECC 2011: 7806-7812 - [c6]Ekaterina Abramova, Aldo Faisal, Daniel Kuhn:
Combining Markov Decision Processes with Linear Optimal Controllers. ICCSW 2011: 3-9
2000 – 2009
- 2009
- [j5]Gido Haarbrücker, Daniel Kuhn:
Valuation of electricity swing options by multistage stochastic programming. Autom. 45(4): 889-899 (2009) - [j4]Daniel Kuhn:
An Information-Based Approximation Scheme for Stochastic Optimization Problems in Continuous Time. Math. Oper. Res. 34(2): 428-444 (2009) - 2008
- [j3]Daniel Kuhn:
Aggregation and discretization in multistage stochastic programming. Math. Program. 113(1): 61-94 (2008) - 2007
- [j2]Nils Weskamp, Eyke Hüllermeier, Daniel Kuhn, Gerhard Klebe:
Multiple Graph Alignment for the Structural Analysis of Protein Active Sites. IEEE ACM Trans. Comput. Biol. Bioinform. 4(2): 310-320 (2007) - [c5]Eyke Hüllermeier, Nils Weskamp, Gerhard Klebe, Daniel Kuhn:
Graph Alignment: Fuzzy Pattern Mining for the Structural Analysis of Protein Active Sites. FUZZ-IEEE 2007: 1-6 - 2004
- [j1]Nils Weskamp, Daniel Kuhn, Eyke Hüllermeier, Gerhard Klebe:
Efficient similarity search in protein structure databases by k-clique hashing. Bioinform. 20(10): 1522-1526 (2004) - [c4]Nils Weskamp, Eyke Hüllermeier, Daniel Kuhn, Gerhard Klebe:
Graph Alignments: A New Concept to Detect Conserved Regions in Protein Active Sites. German Conference on Bioinformatics 2004: 131-140 - 2003
- [c3]Nils Weskamp, Daniel Kuhn, Eyke Hüllermeier, Gerhard Klebe:
Efficient Similarity Search in Protein Structure Databases: Improving Cliqae-Detection through Clique Hashing. German Conference on Bioinformatics 2003: 179-184
1990 – 1999
- 1995
- [c2]Daniel Kuhn, Jean-Luc Buessler, Jean-Philippe Urban:
Neural approach to visual servoing for robotic hand eye coordination. ICNN 1995: 2364-2369 - 1994
- [c1]Stefan Hagmann, Hubert Kihl, Daniel Kuhn, Jean-Philippe Urban:
A Transputer-Based Visually-Guided Robot System Using Neuro-Control. HPCN 1994: 390-395
Coauthor Index
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.
last updated on 2024-10-23 20:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
