Showing papers from National Institute of Informatics and Preferred Infrastructure, Inc. Show all papers
Sydney Poster Session 3, Wed, Dec 9, 10:00 AM–1:00 PM, Hall 1-4 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
This paper proposes a linear programming-based minimum s-t cut algorithm with an optimal Lipschitz constant, yielding the first dynamic algorithm with non-trivial recourse and improved b-matching stability.
Atlanta Poster Session 4, Thu, Dec 10, 4:30 PM–7:30 PM, Hall C1 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
Average sensitivity of offline approximations yields small-loss regret bounds via batch-to-online conversion in random-order online learning.
Sydney Poster Session 4, Wed, Dec 9, 5:00 PM–8:00 PM, Hall 1-4 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.