Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Jain, Kshitij"'
Autor:
Jain, Kshitij, Xie, Jingru, Regan, Kevin, Chen, Cheng, Han, Jie, Li, Steve, Li, Zhuoshu, Phillips, Todd, Sussman, Myles, Troup, Matt, Yu, Angel, Zhuo, Jia
Large recommendation models (LRMs) are fundamental to the multi-billion dollar online advertising industry, processing massive datasets of hundreds of billions of examples before transitioning to continuous online training to adapt to rapidly changin
Externí odkaz:
http://arxiv.org/abs/2410.18111
Autor:
Arseneva, Elena, Bahoo, Yeganeh, Biniaz, Ahmad, Cano, Pilar, Chanchary, Farah, Iacono, John, Jain, Kshitij, Lubiw, Anna, Mondal, Debajyoti, Sheikhan, Khadijeh, Tóth, Csaba D.
Let $P$ and $Q$ be finite point sets of the same cardinality in $\mathbb{R}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$, respectively, are called compatible if for every face $f$ in $G_P$,
Externí odkaz:
http://arxiv.org/abs/2004.07996
Publikováno v:
Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 2020
We study unsupervised multilingual alignment, the problem of finding word-to-word translations between multiple languages without using any parallel data. One popular strategy is to reduce multilingual alignment to the much simplified bilingual setti
Externí odkaz:
http://arxiv.org/abs/2002.00743
Autor:
Akitaya, Hugo A., Dujmovi, Vida, Eppstein, David, Hull, Thomas C., Jain, Kshitij, Lubiw, Anna
Publikováno v:
Journal of Computational Geometry, Vol. 11, No. 1, 2020, pages 397-417
Given a flat-foldable origami crease pattern $G=(V,E)$ (a straight-line drawing of a planar graph on a region of the plane) with a mountain-valley (MV) assignment $\mu:E\to\{-1,1\}$ indicating which creases in $E$ bend convexly (mountain) or concavel
Externí odkaz:
http://arxiv.org/abs/1910.05667
Autor:
Dallas, James, Jain, Kshitij, Dong, Zheng, Cole, Michael P., Jayakumar, Paramsothy, Ersal, Tulga
In this work, a terrain estimation framework is developed for autonomous vehicles operating on deformable terrains. Previous work in this area usually relies on steady state tire operation, linearized classical terramechanics models, or on computatio
Externí odkaz:
http://arxiv.org/abs/1908.00130
Autor:
Kazemi, Seyed Mehran, Goel, Rishab, Jain, Kshitij, Kobyzev, Ivan, Sethi, Akshay, Forsyth, Peter, Poupart, Pascal
Publikováno v:
JMLR, Vol 21, Pages 1-73, 2020
Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static graphs. Howe
Externí odkaz:
http://arxiv.org/abs/1905.11485
Autor:
Demaine, Erik D., Eppstein, David, Hesterberg, Adam, Jain, Kshitij, Lubiw, Anna, Uehara, Ryuhei, Uno, Yushi
We consider problems in which a simple path of fixed length, in an undirected graph, is to be shifted from a start position to a goal position by moves that add an edge to either end of the path and remove an edge from the other end. We show that thi
Externí odkaz:
http://arxiv.org/abs/1905.00518
Autor:
Biniaz, Ahmad, Jain, Kshitij, Lubiw, Anna, Masárová, Zuzana, Miltzow, Tillmann, Mondal, Debajyoti, Naredla, Anurag Murty, Tkadlec, Josef, Turcotte, Alexi
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 24, no 2, Discrete Algorithms (January 18, 2023) dmtcs:8383
The input to the token swapping problem is a graph with vertices $v_1, v_2, \ldots, v_n$, and $n$ tokens with labels $1, 2, \ldots, n$, one on each vertex. The goal is to get token $i$ to vertex $v_i$ for all $i= 1, \ldots, n$ using a minimum number
Externí odkaz:
http://arxiv.org/abs/1903.06981
Autor:
Biedl, Therese, Biniaz, Ahmad, Irvine, Veronika, Jain, Kshitij, Kindermann, Philipp, Lubiw, Anna
$\Theta_6$-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilateral triangles take the place of empty circles. We investigate lower
Externí odkaz:
http://arxiv.org/abs/1901.01476
We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s and t, and the goal is to find an s-t cut by assigning "powers" at the vertices and r
Externí odkaz:
http://arxiv.org/abs/1806.04742