default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAswin Kannan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Ayush Kumar
, Abhay M. Shalghar, Harsh Chauhan, Balaji Ganesan, Ritwik Chaudhuri, Aswin Kannan:
Document structure aware Relation Extraction for Semantic Automation. COMAD/CODS 2024: 232-236- 2021
- [c5]Aswin Kannan, Anamitra Roy Choudhury, Vaibhav Saxena, Saurabh Raje, Parikshit Ram, Ashish Verma, Yogish Sabharwal:
HyperASPO: Fusion of Model and Hyper Parameter Optimization for Multi-objective Machine Learning. IEEE BigData 2021: 790-800 - [i4]Abhay M. Shalghar, Ayush Kumar, Balaji Ganesan, Aswin Kannan, Shobha G:
Document Structure aware Relational Graph Convolutional Networks for Ontology Population. CoRR abs/2104.12950 (2021)
2010 – 2019
- 2019
- [j3]Aswin Kannan, Uday V. Shanbhag:
Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants. Comput. Optim. Appl. 74(3): 779-820 (2019) - 2018
- [i3]Sambaran Bandyopadhyay, Harsh Kara, Aswin Kannan, M. Narasimha Murty:
FSCNMF: Fusing Structure and Content via Non-negative Matrix Factorization for Embedding Information Networks. CoRR abs/1804.05313 (2018) - [i2]Riddhiman Dasgupta, Balaji Ganesan, Aswin Kannan, Berthold Reinwald, Arun Kumar:
Fine Grained Classification of Personal Data Entities. CoRR abs/1811.09368 (2018) - [i1]Aswin Kannan, Shanmukha C. Guttula, Balaji Ganesan, Hima P. Karanam, Arun Kumar:
Document Structure Measure for Hypernym discovery. CoRR abs/1811.12728 (2018) - 2015
- [c4]Aswin Kannan, Angelia Nedic, Uday V. Shanbhag:
Distributed stochastic optimization under imperfect information. CDC 2015: 400-405 - 2014
- [c3]Aswin Kannan, Uday V. Shanbhag:
The pseudomonotone stochastic variational inequality problem: Analytical statements and stochastic extragradient schemes. ACC 2014: 2930-2935 - 2013
- [j2]Aswin Kannan, Uday V. Shanbhag, Harrison M. Kim:
Addressing supply-side risk in uncertain power markets: stochastic Nash models, scalable algorithms and error analysis. Optim. Methods Softw. 28(5): 1095-1138 (2013) - 2012
- [j1]Aswin Kannan, Uday V. Shanbhag:
Distributed Computation of Equilibria in Monotone Nash Games via Iterative Regularization Techniques. SIAM J. Optim. 22(4): 1177-1205 (2012) - 2011
- [c2]Aswin Kannan, Victor M. Zavala:
A game-theoretical model predictive control framework for electricity markets. Allerton 2011: 1280-1285 - 2010
- [c1]Aswin Kannan, Uday V. Shanbhag:
Distributed iterative regularization algorithms for monotone Nash games. CDC 2010: 1963-1968
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-04-25 05:44 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:
