default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. S. Sesh Kumar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j5]Caterina Buizza, César Quilodrán Casas, Philip Nadler, Julian Mack, Stefano Marrone
, Zainab Titus, Clémence Le Cornec, Evelyn Heylen, Tolga Hasan Dur, Luis G. Baca Ruíz, Claire E. Heaney, Julio Amador Díaz López, K. S. Sesh Kumar, Rossella Arcucci:
Data Learning: Integrating Data Assimilation and Machine Learning. J. Comput. Sci. 58: 101525 (2022)- [j4]Michelangelo Conserva, Marc Peter Deisenroth, K. S. Sesh Kumar:
The Graph Cut Kernel for Ranked Data. Trans. Mach. Learn. Res. 2022 (2022) - 2021
- [i7]Samuel Cohen, K. S. Sesh Kumar, Marc Peter Deisenroth:
Sliced Multi-Marginal Optimal Transport. CoRR abs/2102.07115 (2021) - [i6]Michelangelo Conserva, Marc Peter Deisenroth, K. S. Sesh Kumar:
Submodular Kernels for Efficient Rankings. CoRR abs/2105.12356 (2021) - 2020
- [j3]Riccardo Moriconi, Marc Peter Deisenroth, K. S. Sesh Kumar:
High-dimensional Bayesian optimization using low-dimensional feature spaces. Mach. Learn. 109(9-10): 1925-1943 (2020) - [j2]Riccardo Moriconi, K. S. Sesh Kumar, Marc Peter Deisenroth:
High-dimensional Bayesian optimization with projections using quantile Gaussian processes. Optim. Lett. 14(1): 51-64 (2020)
2010 – 2019
- 2019
- [i5]Riccardo Moriconi, K. S. Sesh Kumar, Marc Peter Deisenroth:
High-Dimensional Bayesian Optimization with Manifold Gaussian Processes. CoRR abs/1902.10675 (2019) - [i4]K. S. Sesh Kumar, Marc Peter Deisenroth:
Differentially Private Empirical Risk Minimization with Sparsity-Inducing Norms. CoRR abs/1905.04873 (2019) - 2017
- [j1]K. S. Sesh Kumar, Francis R. Bach:
Active-set Methods for Submodular Minimization Problems. J. Mach. Learn. Res. 18: 132:1-132:31 (2017) - 2016
- [b1]K. S. Sesh Kumar:
On the Links between Probabilistic Graphical Models and Submodular Optimisation. (Liens entre modèles graphiques probabilistes et optimisation sous-modulaire). École Normale Supérieure, Paris, France, 2016 - 2015
- [i3]K. S. Sesh Kumar, Álvaro Barbero Jiménez, Stefanie Jegelka, Suvrit Sra, Francis R. Bach:
Convex Optimization for Parallel Energy Minimization. CoRR abs/1503.01563 (2015) - 2013
- [c5]K. S. Sesh Kumar, Francis R. Bach:
Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs. ICML (1) 2013: 525-533 - [i2]K. S. Sesh Kumar, Francis R. Bach:
Maximizing submodular functions using probabilistic graphical models. CoRR abs/1309.2593 (2013) - 2012
- [i1]K. S. Sesh Kumar, Francis R. Bach:
Convex Relaxations for Learning Bounded Treewidth Decomposable Graphs. CoRR abs/1212.2573 (2012)
2000 – 2009
- 2007
- [c4]K. S. Sesh Kumar, S. Kumar, C. V. Jawahar:
On Segmentation of Documents in Complex Scripts. ICDAR 2007: 1243-1247 - 2006
- [c3]Sachin Rawat, K. S. Sesh Kumar, Million Meshesha, Indraneel Deb Sikdar, A. Balasubramanian, C. V. Jawahar:
A Semi-automatic Adaptive OCR for Digital Libraries. Document Analysis Systems 2006: 13-24 - [c2]K. S. Sesh Kumar, Anoop M. Namboodiri, C. V. Jawahar:
Learning Segmentation of Documents with Complex Scripts. ICVGIP 2006: 749-760 - 2005
- [c1]K. S. Sesh Kumar, Anoop M. Namboodiri, C. V. Jawahar:
Learning to Segment Document Images. PReMI 2005: 471-476
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-09-13 00:43 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:
