#### Filter Results:

- Full text PDF available (21)

#### Publication Year

1997

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ioan Raicu, Ian T. Foster, +4 authors Douglas Thain
- HPDC
- 2009

Data-intensive applications involving the analysis of large datasets often require large amounts of compute and storage resources, for which data locality can be crucial to high throughput andâ€¦ (More)

Outliers are objects that do not comply with the general behavior of the data. Applications such as exploration in science databases need fast interactive tools for outlier detection in data setsâ€¦ (More)

- Ioan Raicu, Ian T. Foster, +10 authors Douglas Thain
- Cluster Computing
- 2010

Many-task computing aims to bridge the gap between two computing paradigms, high throughput computing and high performance computing. Many-task computing denotes high-performance computationsâ€¦ (More)

- Tanu Malik, Randal C. Burns, Amitabh Chaudhary
- 21st International Conference on Data Engineeringâ€¦
- 2005

Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitable for theirâ€¦ (More)

- Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
- Theory of Computing Systems
- 2004

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â€¦ (More)

In this paper we consider the k edge-disjoint paths problem (k-EDP), a generalization of the well-known edge-disjoint paths problem. Given a graph G=(V,E) and a set of terminal pairs (or requests) T,â€¦ (More)

- Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
- Symposium on Computational Geometry
- 2004

We present memory-efficient deterministic algorithms for constructing Îµ-nets and Îµ-approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic samples provideâ€¦ (More)

- Amitabh Chaudhary, Danny Ziyi Chen, Kevin Whitton, Michael T. Niemier, Ramprasad Ravichandran
- ICCAD-2005. IEEE/ACM International Conference onâ€¦
- 2005

When exploring computing elements made from technologies other than CMOS, it is imperative to investigate the effects of physical implementation constraints. This paper focuses on molecularâ€¦ (More)

- Amitabh Chaudhary, Danny Ziyi Chen, Xiaobo Sharon Hu, Michael T. Niemier, Ramprasad Ravichandran, Kevin Whitton
- IEEE Transactions on Computer-Aided Design ofâ€¦
- 2007

When exploring computing elements made from technologies other than complementary metal-oxide-semiconductor, it is imperative to investigate circuits and systems assuming realistic physicalâ€¦ (More)

We propose a bandwidth-efficient algorithmic solution for perfectly-secure communication in the absence of secure infrastructure. Our solution involves connecting vertex pairs by a set of kâ€¦ (More)