Person:
Tetali, Prasad

Associated Organization(s)
Organizational Unit
ORCID
ArchiveSpace Name Record

Publication Search Results

Now showing 1 - 3 of 3
  • Item
    Support-Theoretic Subgraph Preconditioners for Large-Scale SLAM
    (Georgia Institute of Technology, 2013-11) Jian, Yong-Dian ; Balcan, Doru ; Panageas, Ioannis ; Tetali, Prasad ; Dellaert, Frank
    Efficiently solving large-scale sparse linear systems is important for robot mapping and navigation. Recently, the subgraph-preconditioned conjugate gradient method has been proposed to combine the advantages of two reigning paradigms, direct and iterative methods, to improve the efficiency of the solver. Yet the question of how to pick a good subgraph is still open. In this paper, we propose a new metric to measure the quality of a spanning tree preconditioner based on support theory. We use this metric to develop an algorithm to find good subgraph preconditioners and apply them to solve the SLAM problem. The results show that although the proposed algorithm is not fast enough, the new metric is effective and resulting subgraph preconditioners significantly improve the efficiency of the state-of-the-art solver.
  • Item
    Extremal problems in combinatorics and their applications
    (Georgia Institute of Technology, 2013-06) Tetali, Prasad
    The goals of this project were to study several fundamental problems in extremal combinatorics, many of them motivated by problems in theoretical computer science.
  • Item
    Information inequalities and combinatorial applications
    (Georgia Institute of Technology, 2011-08-14) Tetali, Prasad