Zobrazeno 1 - 10
of 56
pro vyhledávání: '"Chaudhary, Amitabh"'
Autor:
Manne, Naga Nithin, Satpati, Shilvi, Malik, Tanu, Bagchi, Amitabha, Gehani, Ashish, Chaudhary, Amitabh
In scientific computing and data science disciplines, it is often necessary to share application workflows and repeat results. Current tools containerize application workflows, and share the resulting container for repeating results. These tools, due
Externí odkaz:
http://arxiv.org/abs/2202.08429
Autor:
Chaudhary, Amitabh.
Publikováno v:
Available to US Hopkins community.
Thesis (Ph. D.)--Johns Hopkins University, 2003.
Vita. U.M.I. no. 3068131. Includes bibliographical references (leaves 79-84).
Vita. U.M.I. no. 3068131. Includes bibliographical references (leaves 79-84).
Externí odkaz:
http://wwwlib.umi.com/dissertations/dlnow/3068131
Modern scientific repositories are growing rapidly in size. Scientists are increasingly interested in viewing the latest data as part of query results. Current scientific middleware cache systems, however, assume repositories are static. Thus, they c
Externí odkaz:
http://arxiv.org/abs/1009.3665
Autor:
Malik, Tanu, Prasad, Raghvendra, Patil, Sanket, Chaudhary, Amitabh, Venkatasubramanian, Venkat
Topology is a fundamental part of a network that governs connectivity between nodes, the amount of data flow and the efficiency of data flow between nodes. In traditional networks, due to physical limitations, topology remains static for the course o
Externí odkaz:
http://arxiv.org/abs/1005.4695
Autor:
Bagchi, Amitabha, Bhargava, Ankur, Chaudhary, Amitabh, Eppstein, David, Scheideler, Christian
Publikováno v:
Theor. Comput. Syst. 39(6):903-928. November 2006
In this paper we study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain so that it still contains a large (i.e. linear-sized) connected component that still h
Externí odkaz:
http://arxiv.org/abs/cs/0404029
Publikováno v:
ACM Trans. Algorithms 3(2):A16, 2007
We present memory-efficient deterministic algorithms for constructing epsilon-nets and epsilon-approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic samples provide guaranteed bounds on their approximation
Externí odkaz:
http://arxiv.org/abs/cs/0307027
Publikováno v:
In Theoretical Computer Science 2011 412(39):5247-5275
Publikováno v:
In Theoretical Computer Science 2005 339(2):315-332
Publikováno v:
In Journal of Algorithms November 2001 41(2):404-416
Autor:
Bagchi, Amitabha1 bagchi@cse.iitd.ernet.in, Chaudhary, Amitabh2 chaudhary.1@nd.edu, Scheideler, Christian3 scheideler@in.tum.de, Kolman, Petr4 kolman@kam.mff.cuni.cz
Publikováno v:
SIAM Journal on Discrete Mathematics. 2007, Vol. 21 Issue 1, p141-157. 17p. 1 Diagram.