author-photo

Ness B. Shroff

Ohio State University
Purdue University

626

Papers

20156

Citations

Citation Trend

Filter By

Papers (626) Sort By

JournalConferenceOthers

A faster FPTAS for knapsack problem with cardinality constraint.

2022 Discret. Appl. Math.
Show All
- Source
- Cite
- Save
Citations (0)
Weighted Gaussian Process Bandits for Non-stationary Environments.

2022 AISTATS | International Conference on Artificial Intelligence and Statistics
Show All
- Source
- Cite
- Save
Citations (0)
Optimizing Sampling for Data Freshness: Unreliable Transmissions with Random Two-way Delay.

2022 CoRR
Show All
- Source
- Cite
- Save
Citations (0)
Battle between Rate and Error in Minimizing Age of Information

2021 MobiHoc | Mobile Ad Hoc Networking and Computing
Show All
- Source
- Cite
- Save
Citations (0)
Sample Complexity Bounds for Active Ranking from Multi-wise Comparisons

2021 NeurIPS | Neural Information Processing Systems
Show All
- Source
- Cite
- Save
Citations (0)
Weighted Gaussian Process Bandits for Non-stationary Environments.

2021 arXiv: Learning
Show All
- Source
- Cite
- Save
Citations (0)
Adaptive Control of Differentially Private Linear Quadratic Systems

2021 ISIT | International Symposium on Information Theory
Show All
- Source
- Cite
- Save
Citations (0)
Adaptive Control of Differentially Private Linear Quadratic Systems

2021 arXiv: Learning
Show All
- Source
- Cite
- Save
Citations (0)
Low-Power Status Updates via Sleep-Wake Scheduling.

2021 arXiv: Information Theory
Show All
- Source
- Cite
- Save
Citations (0)
On Logarithmic Regret for Bandits with Knapsacks

2021 CISS | Conference on Information Sciences and Systems
Show All
- Source
- Cite
- Save
Citations (0)

© Copyright 2015-2020 Acemap, Inc. Shanghai Jiao Tong University.

沪ICP备18028330号