Ruchi Mahindru

Learn More
For the most part, the system we used for TREC2003 was a smooth evolution of the one we ran in TREC2002 [Chu-Carroll et al, 2003b]. We continued to use our multi-source and multi-agent architecture. For Factoid questions we used all of our previous answering agents with an additional pattern-based agent, an enhanced answer resolution algorithm, and(More)
Cloud-based offerings such as Infrastructure-as-aservice (IaaS), Platform-as-a-Service (PaaS), and Software-as-a-Service (SaaS), are being delivered by various vendors at highly competitive prices to encourage a paradigm shift to utility computing. To optimize the operational costs of managing an IBM Cloud-based PaaS offering, a two-pronged approach has(More)
We give a 5-approximation algorithm to the rooted Subtree-Prune-and-Regraft (rSPR) distance between two phylogenies, which was recently shown to be NP-complete. This paper presents the first approximation result for this important tree distance. The algorithm follows a standard format for tree distances. The novel ideas are in the analysis. In the analysis,(More)
In this paper we propose a novel technique to automatically structure problem tickets consisting of free form, heterogeneous textual data, so that IT problem isolation and resolution can be performed rapidly. The originality of our technique consists in applying the conditional random fields (CRFs) supervised learning process to automatically identify(More)
Due to increased competition in the IT Services business, improving quality, reducing costs and shortening schedules has become extremely important. A key strategy being adopted for achieving these goals is the use of an asset-based approach to service delivery, where standard reusable components developed by domain experts are minimally modified for each(More)
We give a 5-approximation algorithm to the rooted Subtree-Prune-and-Regraft (rSPR) distance between two phylogenies, which was recently shown to be NP-complete. This paper presents the first approximation result for this important tree distance. The algorithm follows a standard format for tree distances. The novel ideas are in the analysis. In the analysis,(More)
We propose a novel technique to enhance the IT problem isolation and resolution Maintenance Services by automatically structuring problem tickets consisting of free form, heterogeneous textual data. The originality of our technique consists in applying the Conditional Random Fields (CRFs) supervised learning process to automatically identify individual(More)
We describe disaster protection and recovery of cloud-hosted enterprise applications both at the cloud infrastructure level and at the application level. We explore scenarios which favor one option over the other, and scenarios where a combination of both are required for effective and end-to-end protection. Through case studies grounded in the experience(More)