Zobrazeno 1 - 10
of 690
pro vyhledávání: '"Wang, Joshua"'
Autor:
Guruganesh, Guru, Kolumbus, Yoav, Schneider, Jon, Talgam-Cohen, Inbal, Vlatakis-Gkaragkounis, Emmanouil-Vasileios, Wang, Joshua R., Weinberg, S. Matthew
Many real-life contractual relations differ completely from the clean, static model at the heart of principal-agent theory. Typically, they involve repeated strategic interactions of the principal and agent, taking place under uncertainty and over ti
Externí odkaz:
http://arxiv.org/abs/2401.16198
We study scheduling of computation graphs to minimize peak memory consumption, an increasingly critical task due to the surge in popularity of large deep-learning models. This problem corresponds to the weighted version of the classical one-shot blac
Externí odkaz:
http://arxiv.org/abs/2312.13526
Autor:
Wang, Joshua
We propose a PnP algorithm for a camera constrained to two-dimensional motion (applicable, for instance, to many wheeled robotics platforms). Leveraging this assumption allows accuracy and performance improvements over 3D PnP algorithms due to the re
Externí odkaz:
http://arxiv.org/abs/2312.08488
Autor:
Gujral, Onkar Singh, Wang, Joshua
A conjecture of Shumakovitch states that every nontrivial knot has 2-torsion in its Khovanov homology. We show that if a knot $K$ has no 2-torsion in its Khovanov homology, then the rank of its reduced Khovanov homology is minimal among all knots obt
Externí odkaz:
http://arxiv.org/abs/2310.06163
We study the power of menus of contracts in principal-agent problems with adverse selection (agents can be one of several types) and moral hazard (we cannot observe agent actions directly). For principal-agent problems with $T$ types and $n$ actions,
Externí odkaz:
http://arxiv.org/abs/2306.12667
Online caching is among the most fundamental and well-studied problems in the area of online algorithms. Innovative algorithmic ideas and analysis -- including potential functions and primal-dual techniques -- give insight into this still-growing are
Externí odkaz:
http://arxiv.org/abs/2305.02508
Autor:
Wang, Joshua
The sl(N) homology of the torus knot or link T(2,m) may be calculated explicitly. By direct comparison, the result is isomorphic to the cohomology of a naturally associated space of SU(N) representations of the knot group. In honor of Tom Mrowka's 60
Externí odkaz:
http://arxiv.org/abs/2212.14499
Autor:
Wang, Joshua
We provide the first complete computations of colored sl(N) homology for a nontrivial knot. In doing so, we show that the colored sl(N) homology of the trefoil labeled by an exterior power of the defining representation is isomorphic to the cohomolog
Externí odkaz:
http://arxiv.org/abs/2211.08409
Autor:
Chen, Laisi, Wu, Amy X., Tulu, Naol, Wang, Joshua, Juanson, Adrian, Watanabe, Kenji, Taniguchi, Takashi, Pettes, Michael T., Campbell, Marshall, Gadre, Chaitanya A., Zhou, Yinong, Chen, Hangman, Cao, Penghui, Jauregui, Luis A., Wu, Ruqian, Pan, Xiaoqing, Sanchez-Yamagishi, Javier D.
Confining materials to two-dimensional forms changes the behavior of electrons and enables new devices. However, most materials are challenging to produce as uniform thin crystals. Here, we present a new synthesis approach where crystals are grown in
Externí odkaz:
http://arxiv.org/abs/2211.07681
Caching is a crucial component of many computer systems, so naturally it is a well-studied topic in algorithm design. Much of traditional caching research studies cache management for a single-user or single-processor environment. In this paper, we p
Externí odkaz:
http://arxiv.org/abs/2207.05975