default search action
Yangguang Shi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Yuval Emek, Ron Lavi, Rad Niazadeh
, Yangguang Shi
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes. Math. Oper. Res. 49(2): 880-900 (2024) - [c20]Yongyi Hu, Xueyan Li, Xikai Wei, Yangguang Shi, Xiaofeng Gao, Guihai Chen:
Corruption Robust Dynamic Pricing in Liner Shipping under Capacity Constraint. ICDE 2024: 5035-5047 - [c19]Yucen Gao
Online Preference Weight Estimation Algorithm with Vanishing Regret for Car-Hailing in Road Network. KDD 2024: 863-871 - 2023
- [c18]Yuting He, Renjie Huang, Yangguang Shi, Guoqiang Xiao, Bin Yang, Yuqi Li:
Scale-Adaptive Tiny Object Detection Enhanced by Across-Scale and Shape-Preserved Semantic Location. ICASSP 2023: 1-5 - [c17]Yucen Gao, Xikai Wei, Xi Jing, Yangguang Shi, Xiaofeng Gao, Guihai Chen:
Online Shipping Container Pricing Strategy Achieving Vanishing Regret with Limited Inventory. ICDE 2023: 1719-1731 - [c16]Renjie Huang, Yangguang Shi, Yuting He, Yongqiang Zheng, Guoqiang Xiao, Ziruo Liu:
Semantic Circle Detection and Circle-Inner Segmentation for Tree-Wise Citrus Summer Shoot Management in Aerial Images. ICIP 2023: 1090-1094 - [c15]Renjie Huang, Ziruo Liu, Jichuan Chen, Yangguang Shi, Guoqiang Xiao:
Geometric Prior-Assisted Feature Presentation Enhancement for Object Detection in Aerial Images. ICIP 2023: 1095-1099 - [c14]Dejun Kong
An Approximation for Job Scheduling on Cloud with Synchronization and Slowdown Constraints. INFOCOM 2023: 1-10 - [c13]Jiadong Chen
IPOC: An Adaptive Interval Prediction Model based on Online Chasing and Conformal Inference for Large-Scale Systems. KDD 2023: 202-212 - 2022
- [c12]Zhiran Zhou
Dual Guidance Of Optical Flow And Decoupled Attention For Infrared Video Object Detection Network. EITCE 2022: 191-195 - [c11]Renjie Huang, Yuting He, Guoqiang Xiao, Yangguang Shi, Yongqiang Zheng:
Adaptive Tiny Object Detection for Improving Pest Detection. ICPR 2022: 4544-4551 - 2021
- [c10]Yuval Emek, Shay Kutten, Yangguang Shi:
Online Paging with a Vanishing Regret. ITCS 2021: 67:1-67:20 - 2020
- [j3]Yuval Emek, Shay Kutten, Ron Lavi
Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency. J. ACM 67(1): 7:1-7:33 (2020) - [j2]Yuval Emek
Bayesian generalized network design. Theor. Comput. Sci. 841: 167-185 (2020) - [c9]Yuval Emek, Ron Lavi, Rad Niazadeh, Yangguang Shi:
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes. NeurIPS 2020 - [i4]Yuval Emek, Shay Kutten, Ron Lavi, Rad Niazadeh, Yangguang Shi:
No-Regret Stateful Posted Pricing. CoRR abs/2005.01869 (2020) - [i3]Yuval Emek, Shay Kutten, Yangguang Shi:
Online Paging with a Vanishing Regret. CoRR abs/2011.09439 (2020)
2010 – 2019
- 2019
- [c8]Yuval Emek, Shay Kutten, Ron Lavi
Bayesian Generalized Network Design. ESA 2019: 45:1-45:16 - [i2]Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi:
Bayesian Generalized Network Design. CoRR abs/1907.00484 (2019) - 2018
- [c7]Yuval Emek, Shay Kutten, Ron Lavi
Approximating generalized network design under (dis)economies of scale with applications to energy efficiency. STOC 2018: 598-606 - [i1]Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi:
Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency. CoRR abs/1803.05361 (2018) - 2017
- [c6]Youshi Wang, Fa Zhang, Rui Wang, Yangguang Shi, Hua Guo, Zhiyong Liu:
Real-time Task Scheduling for joint energy efficiency optimization in data centers. ISCC 2017: 838-843 - [c5]Yangguang Shi, Fa Zhang, Zhiyong Liu:
Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs. TAMC 2017: 571-585 - 2016
- [c4]Mingzhe Zhang, Yangguang Shi, Fa Zhang, Zhiyong Liu:
COMRANCE: A rapid method for Network-on-Chip design space exploration. IGSC 2016: 1-8 - 2015
- [j1]Yangguang Shi, Fa Zhang, Jie Wu, Zhiyong Liu:
Randomized oblivious integral routing for minimizing power cost. Theor. Comput. Sci. 607: 221-246 (2015) - 2014
- [c3]Yangguang Shi, Fa Zhang, Zhiyong Liu:
Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost. FAW 2014: 216-228 - [c2]Yangguang Shi, Fa Zhang, Zhiyong Liu:
Polylogarithmic Competitive Algorithm for Energy Minimization in Optical WDM Networks. ICNP 2014: 197-202 - 2013
- [c1]Yangguang Shi, Fa Zhang, Zhiyong Liu:
A Universally Stable and Energy-Efficient Scheduling Protocol for Packet Switching Network. NCA 2013: 118-126
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-10 02:09 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: