Zobrazeno 1 - 10
of 4 125
pro vyhledávání: '"A. Ramanujan"'
Autor:
Wallingford, Matthew, Bhattad, Anand, Kusupati, Aditya, Ramanujan, Vivek, Deitke, Matt, Kakade, Sham, Kembhavi, Aniruddha, Mottaghi, Roozbeh, Ma, Wei-Chiu, Farhadi, Ali
Three-dimensional (3D) understanding of objects and scenes play a key role in humans' ability to interact with the world and has been an active area of research in computer vision, graphics, and robotics. Large scale synthetic and object-centric 3D d
Externí odkaz:
http://arxiv.org/abs/2412.07770
Autor:
Bentert, Matthias, Fomin, Fedor V., Golovach, Petr A., Korhonen, Tuukka, Lochet, William, Panolan, Fahad, Ramanujan, M. S., Saurabh, Saket, Simonov, Kirill
Cycle packing is a fundamental problem in optimization, graph theory, and algorithms. Motivated by recent advancements in finding vertex-disjoint paths between a specified set of vertices that either minimize the total length of the paths [Bj\"orklun
Externí odkaz:
http://arxiv.org/abs/2410.18878
In many real-world routing problems, decision makers must optimise over sparse graphs such as transportation networks with non-metric costs on the edges that do not obey the triangle inequality. Motivated by finding a sufficiently long running route
Externí odkaz:
http://arxiv.org/abs/2410.10440
Over the last decade, extensive research has been conducted on the algorithmic aspects of designing single-elimination (SE) tournaments. Addressing natural questions of algorithmic tractability, we identify key properties of input instances that enab
Externí odkaz:
http://arxiv.org/abs/2408.15068
In this paper, we study the Eulerian Strong Component Arc Deletion problem, where the input is a directed multigraph and the goal is to delete the minimum number of arcs to ensure every strongly connected component of the resulting digraph is Euleria
Externí odkaz:
http://arxiv.org/abs/2408.13819
Autor:
Geng, Scott, Hsieh, Cheng-Yu, Ramanujan, Vivek, Wallingford, Matthew, Li, Chun-Liang, Koh, Pang Wei, Krishna, Ranjay
Generative text-to-image models enable us to synthesize unlimited amounts of images in a controllable manner, spurring many recent efforts to train vision models with synthetic data. However, every synthetic image ultimately originates from the upstr
Externí odkaz:
http://arxiv.org/abs/2406.05184
We study the parameterized complexity of a generalization of the coordinated motion planning problem on graphs, where the goal is to route a specified subset of a given set of $k$ robots to their destinations with the aim of minimizing the total ener
Externí odkaz:
http://arxiv.org/abs/2404.15950
Single-elimination (SE) tournaments are a popular format used in competitive environments and decision making. Algorithms for SE tournament manipulation have been an active topic of research in recent years. In this paper, we initiate the algorithmic
Externí odkaz:
http://arxiv.org/abs/2402.06538
Given a simple connected undirected graph G = (V, E), a set X \subseteq V(G), and integers k and p, STEINER SUBGRAPH EXTENSION problem asks if there exists a set S \supseteq X with at most k vertices such that G[S] is p-edge-connected. This is a natu
Externí odkaz:
http://arxiv.org/abs/2311.02708
Radar-based techniques for detecting vital signs have shown promise for continuous contactless vital sign sensing and healthcare applications. However, real-world indoor environments face significant challenges for existing vital sign monitoring syst
Externí odkaz:
http://arxiv.org/abs/2310.05507