Akshay Soni

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Troy Chevalier

> Home > Persons > Akshay Soni

Publications

2017
[c13]
- view
  - electronic edition @ aclanthology.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/ijcnlp/SoniPNC17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcnlp/SoniPNC17
Akshay Soni, Aasish Pappu, Jerry Chia-mau Ni, Troy Chevalier:
Post-Processing Techniques for Improving Predictions of Multilabel Learning Approaches. IJCNLP(2) 2017: 61-66
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/isit/SoniCJ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/SoniCJ17
Akshay Soni, Troy Chevalier, Swayambhoo Jain:
Noisy inductive matrix completion under sparse factor models. ISIT 2017: 2990-2994
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/kdd/ShahSC17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kdd/ShahSC17
Parikshit Shah, Akshay Soni, Troy Chevalier:
Online Ranking with Constraints: A Primal-Dual Algorithm and Applications to Web Traffic-Shaping. KDD 2017: 405-414
2016
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/SoniCJ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/SoniCJ16
Akshay Soni, Troy Chevalier, Swayambhoo Jain:
Noisy Inductive Matrix Completion Under Sparse Factor Models. CoRR abs/1609.03958 (2016)

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.