1 Similarity Searching in Peer-to-Peer Databases (2009)
Indrajit Bhattacharya, Srinivas R. Kashyap, Srinivasan Parthasarathy
We consider the problem of handling similarity queries in peer-to-peer databases. We propose an indexing and searching mechanism which, given a query object, returns the set of objects in the...
TRAN, Quoc Trung, CHAN, Chee Yong, PARTHASARATHY, Srinivasan
It has recently been asserted that the usability of a database is as important as its capability. Understanding the database schema,the hidden relationships among attributes in the data all play an...
Robert Stets, Hya Dwarkadas, Nikolaos Hardavellas, Galen Hunt, Leonidas Kontothanassis, Srinivasan Parthasarathy, ...
Low-latency, remote-write-access networks have recently become commodity items. These networks can connect clusters of symmetric multiprocessors (SMPs) to form very cost-effective, large scale...
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints* (2009)
V. S. Anil, Kumar Madhav, V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
An Architecture-conscious Solution (2009)
Gregory Buehrer, Tahsin Kurc, Srinivasan Parthasarathy, Shirish Tatikonda, Joel Saltz
We present a strategy for mining frequent itemsets from terabyte-scale data sets on cluster systems. The algorithm embraces the holistic notion of architecture-conscious data mining, taking into...
An Empirical Comparison of Outlier Detection Algorithms (2009)
Matthew Eric Otey, Srinivasan Parthasarathy, Amol Ghoting
In recent years, researchers have proposed many different techniques for detecting outliers and other anomalies in data sets. In this paper we wish to examine a subset of these techniques, those that...
Predicting functionality of protein-DNA interactions by integrating diverse evidence (2009)
Ucar, Duygu, Beyer, Andreas, Parthasarathy, Srinivasan, Workman, Christopher T.
Chromatin immunoprecipitation (ChIP-chip) experiments enable capturing physical interactions between regulatory proteins and DNA in vivo. However, measurement of chromatin binding alone is not...
Amol Ghoting, Gregory Buehrer, Matthew Goyder, Shirish Tatikonda, Xi Zhang, Srinivasan Parthasarathy, ...
The knowledge discovery process is interactive in nature and therefore minimizing query response time is imperative. The compute and memory intensive nature of data mining algorithms makes this task...
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks (2008)
Deepti Chafekar, Dave Levin, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question we answer is: how...
Deepti Chafekar, Srinivasan Parthasarathy
Recently, there has been substantial interest in the design of crosslayer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g. latency, energy,...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
Abstract. In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for answering approximate queries as well as for determining an...
VM-Based Shared Memory on Low-Latency, Remote-Memory-Access Networks Abstract (2008)
Leonidas Kontothanassisy, Galen Hunt, Robert Stets, Nikolaos Hardavellas, Michał Cierniak, Srinivasan Parthasarathy, ...
Recent technological advances have produced network interfaces that provide users with very low-latency access to the memory of remote machines. We examine the impact of such networks on the...
Learning Approximate MRFs From Large Transaction Data (2008)
Chao Wang, Srinivasan Parthasarathy
In this paper we consider the problem of learning approximate Markov Random Fields (MRFs) from large transaction data. We rely on frequent itemsets to learn MRFs on the data. Since learning exact...
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints ∗ (2008)
V. S. Anil, Kumar Madhav, V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
We present polylogarithmic approximations for the R|prec|Cmax and R|prec | � j wjCj problems, when the precedence constraints are “treelike ”- i.e., when the undirected graph underlying the...
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR constraints (2008)
Deepti Chafekar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Abstract—A fundamental problem in wireless networks is to estimate its throughput capacity- given a set of wireless nodes, and a set of connections, what is the maximum rate at which data can be...
Research Track Paper Out-of-Core Frequent Pattern Mi ni ng on a C ommodi ty PC ABSTRACT (2008)
Gregory Buehrer, Srinivasan Parthasarathy, Amol Ghoting
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset mining algorithms and...
Computer and Information ScienceOhio State University, (2008)
Hui Yang, Srinivasan Parthasarathy, Eep Reddy
On the use of constrained associations for weblog mining
On the Use of Structure and Sequence-Based Features for Protein Classification and Retrieval (2008)
Keith Marsolo, Srinivasan Parthasarathy
The need to retrieve or classify protein molecules using structure or sequence-based similarity measures underlies a wide range of biomedical applications. In drug discovery, researchers search for...
COMPLEXITY—Tradeoffs between Complexity Measures General Terms (2008)
Virginia Bio-informatics, Srinivasan Parthasarathy, Madhav V. Marathe, Virginia Bio-informatics, Aravind Srinivasan
Given a wireless network and a collection of source-destination pairs {(si, ti)}, what is the maximum end-to-end rate (throughput) at which the network can transfer data from the sources to their...
Summarizing Itemset Patterns Using Probabilistic Models ∗ ABSTRACT (2008)
Chao Wang, Srinivasan Parthasarathy
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interpretation,...
Classification of Biomedical Data Through Model-based Spatial Averaging (2008)
Keith Marsolo, Srinivasan Parthasarathy
Ensemble learning is frequently used to reduce classification error. The more popular techniques draw multiple samples from the training data and employ a voting procedure to aggregate the decisions...
The Implementation of Cashmere (2008)
Robert J. Stets, Deqing Chen, Hya Dwarkadas, Nikolaos Hardavellas, Galen C. Hunt, Leonidas Kontothanassis, ...
Cashmere is a software distributed shared memory (SDSM) system designed for today’s high performance cluster architectures. These clusters typically consist of symmetric multiprocessors (SMPs)...
Xi Zhang, Tahsin Kurc, Joel Saltz, Srinivasan Parthasarathy
Sampling is a widely used technique to increase efficiency in database and data mining applications operating on large dataset. In this paper we present a scalable sampling implementation that...
Provable Algorithms for Parallel Sweep Scheduling on Unstructured (2008)
V. S. Anil, Kumar Madhav, V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan, Sibylle Zust
We present provably efficient parallel algorithms for sweep scheduling on unstructured meshes. Sweep scheduling is a commonly used technique in Radiation Transport problems, and involves inverting an...
VM-Based Shared Memory on Low-Latency, Remote-Memory-Access Networks Abstract (2008)
Leonidas Kontothanassis Y, Galen Hunt, Robert Stets, Nikolaos Hardavellas, Michał Cierniak, Srinivasan Parthasarathy, ...
Recent technological advances have produced network interfaces that provide users with very low-latency access to the memory of remote machines. We examine the impact of such networks on the...
CSV: Visualizing and Mining Cohesive Subgraphs (2008)
Nan Wang, Srinivasan Parthasarathy, Kian-lee Tan
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network analysis, from the...
Algorithmic Aspects of Capacity in Wireless Networks (2008)
V. S. Anil, Kumar Madhav, V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
This paper considers two inter-related questions: (i) Given a wireless ad-hoc network and a collection of source-destination pairs {(si,ti)}, what is the maximum throughput capacity of the network,...
Learning Approximate MRFs From Large Transactional Data ⋆ (2008)
Chao Wang, Srinivasan Parthasarathy
Abstract. In this paper we consider the problem of learning approximate Markov Random Fields (MRFs) from large transactional data. We rely on frequent itemsets to learn MRFs on the data. Since...
Vol. 23 ISMB/ECCB 2007, pages i29–i40 BIOINFORMATICS doi:10.1093/bioinformatics/btm212 (2008)
Interaction Networks, Sitaram Asur, Duygu Ucar, Srinivasan Parthasarathy
Motivation: Protein–Protein Interaction (PPI) networks are believed to be important sources of information related to biological processes and complex metabolic functions of the cell. The presence...
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints (2008)
V. S. Anil, Kumar Madhav, V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
We present polylogarithmic approximations for the R|prec|Cmax and R|prec | � j wjCj problems, when the precedence constraints are “treelike ”- i.e., when the undirected graph underlying the...
Abstract Towards Data Mining on Emerging Architectures (2008)
Gregory Buehrer, Srinivasan Parthasarathy, Anthony Nguyen, Daehyun Kim, Yen-kuang Chen, Pradeep Dubey
Recent advances in microprocessor design have given rise to new commodity architectures. One such innovation is to place multiple cores on a single chip, called Chip Multiprocessing (CMP). Each core...
End-to-End Packet-Scheduling in Wireless Ad-hoc Networks (2008)
V. S. Anil, Kumar Madhav, V. Marathe, Srinivasan Parthasarathy
Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstraction here, and we study...
Professional and Academic Experience (2008)
Sitaram Asur, Supervisor Dr, Srinivasan Parthasarathy
Data Mining, Machine Learning. In particular, I am extremely interested in developing algorithms for mining static and dynamic (evolving) interaction networks, targeting applications in social...
Amol Ghoting, Supervisor Prof, Srinivasan Parthasarathy
Performed research in the areas of high performance data mining, architecture-conscious algorithms, data stream processing and mining, interactive data mining, and outlier and anomaly detection
Chao Wang, Ruoming Jin, Srinivasan Parthasarathy
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining an optimal query...
Automatic View Recognition for Cardiac Ultrasound Images (2008)
Matthew Eric Otey, Jinbo Bi, Sriram Krishnan, Bharat Rao, Jonathan Stoeckel, Alan Katz, ...
Abstract. Ultrasound images of the heart can be taken from many different angles. Diagnostic analysis of these images requires recognizing the pose of the heart so that important cardiac structures...
Toward Unsupervised Correlation Preserving Discretization (2008)
Sameep Mehta, Srinivasan Parthasarathy, Hui Yang
Abstract—Discretization is a crucial preprocessing technique used for a variety of data warehousing and mining tasks. In this paper, we present a novel PCA-based unsupervised algorithm for the...
Improvements to Response-Surface Based Vehicle Design using a Feature-Centric Approach (2008)
David Thompson, Srinivasan Parthasarathy, Raghu Machiraju, Scott Lawrence
Abstract. In this paper, we present our vision for a framework to facilitate computationally-based aerospace vehicle design by improving the quality of the response surfaces that can be developed for...
End-to-End Packet-Scheduling in Wireless Ad-hoc Networks (2008)
V. S. Anil, Kumar Madhav, V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstraction here, and we...
Universidade Federal de Minas Gerais (2008)
Adriano Veloso, Wagner Meira, Srinivasan Parthasarathy, Mohammed Zaki
This paper deals with new approaches to maintaining frequent itemsets in evolving databases. Our new approaches make use of incremental techniques to provide significant I/O reduction, and parallel...
An E cient Algorithm for Concurrent Priority Queue Heaps (2008)
Galen C. Hunt, Maged M. Michael, Srinivasan Parthasarathy, Michael L. Scott
We present a new algorithm for concurrent access to array-based priority queue heaps. Deletions proceed top-down as they do in a previous algorithm due to Rao and Kumar [7], but insertions proceed...
Facilitating Interactive Distributed Data Stream Processing and Mining (2008)
Amol Ghoting And, Amol Ghoting, Srinivasan Parthasarathy
The past few years have seen the emergence of application domains that need to process data elements arriving as a continuous stream. Recently, several architectures to process database queries over...
The Implementation of Cashmere (2007)
Robert J. Stets, Deqing Chen, Sandhya Dwarkadas, Hya Dwarkadas, Nikolaos Hardavellas, Galen C. Hunt, ...
Cashmere is a software distributed shared memory (SDSM) system designed for today's high performance cluster architectures. These clusters typically consist of symmetric multiprocessors (SMPs)...
ARTICLE NO. PC971339 Customized Dynamic Load Balancing for a Network of Workstations 1 (2007)
Mohammed Javeed Zaki, Wei Li, Srinivasan Parthasarathy
Load balancing involves assigning to each processor work proportional to its performance, thereby minimizing the execution time of a program. Although static load balancing can solve many problems...
Universidade Federal de Minas Gerais (2007)
Adriano Veloso, Wagner Meira, Srinivasan Parthasarathy, Mohammed Zaki
This paper deals with new approaches to maintaining frequent itemsets in evolving databases. Our new approaches make use of incremental techniques to provide significant I/O reduction, and parallel...
Dependent Rounding in Bipartite Graphs Rajiv Gandhi (2007)
Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan
We combine the pipage rounding technique of Ageev & Sviridenko witha recent rounding method developed by Srinivasan, to develop a new randomized rounding approach for fractional vectors defined...
Srinivasan Parthasarathy, Mohammed J. Zaki, Mitsunori Ogihara, Wei Li
Abstract. In this paper we present a new parallel algorithm for data mining of association rules on shared-memory multiprocessors. We study the degree of parallelism, synchronization, and data...
Srinivasan Parthasarathy, Ramesh Subramonian
Mining data efficiently is usually a difficult problem due to the size of the datasets involved, the time complexity of the mining operations, and the interactivity in the mining process. Moreover,...
Abstract S-DSM for Heterogeneous Machine Architectures (2007)
Eduardo Pinheiro, Deqing Chen, Hya Dwarkadas, Srinivasan Parthasarathy, Michael L. Scott
Many—indeed most—distributed applications employ some notion of distributed shared state: information required at more than one location. For applications that span the Internet, this state is...
Srinivasan Parthasarathy, Ramesh Subramonian
The computationally-intensive nature of many data mining algorithms and the size of the datasets involved has motivated eorts to use parallel computing to produce timely results. A particularly cost...
Parallel, Incremental and Interactive Mining for (2007)
Frequent Itemsets In, Adriano Veloso, Wagner Meira, Srinivasan Parthasarathy, Mohammed Zaki
This paper deals with new approaches to maintaining frequent itemsets in evolving databases. Our new approaches make use of incremental techniques to provide significant I/O reduction, and parallel...
Incremental Techniques for Mining Dynamic and Distributed Databases (2007)
Matthew Eric, Otey Adriano, Veloso Chao Wang, Srinivasan Parthasarathy, Wagner Meira
Traditional methods for data mining typically make the assumptions that the data is centralized and static. These assumptions are no longer tenable. Such methods impose excessive communication...
Universidade Federal de Minas Gerais (2007)
Adriano Veloso, Wagner Meira, Srinivasan Parthasarathy
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of data in order to...
Ucar, Duygu, Neuhaus, Isaac, Ross-MacDonald, Petra, Tilford, Charles, Parthasarathy, Srinivasan, Siemers, Nathan, ...
Motivation: Gene expression profiling is an important tool for gaining insight into biology. Novel strategies are required to analyze the growing archives of microarray data and extract useful...
An ensemble framework for clustering protein protein interaction networks (2007)
Asur, Sitaram, Ucar, Duygu, Parthasarathy, Srinivasan
Motivation: Protein–Protein Interaction (PPI) networks are believed to be important sources of information related to biological processes and complex metabolic functions of the cell. The presence...
Yang, Hui, Parthasarathy, Srinivasan, Ucar, Duygu
Abstract Understanding the protein folding mechanism remains a grand challenge in structural biology. In the past several years, computational theories in molecular dynamics have been employed to...
Lcs-trim: Dynamic programming meets xml indexing and querying (2007)
Shirish Tatikonda, Srinivasan Parthasarathy, Matthew Goyder
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the queries and the data...
An ensemble framework for clustering protein-protein interaction networks (2007)
Sitaram Asur, Srinivasan Parthasarathy, Duygu Ucar
Protein-Protein Interaction (PPI) networks are believed to be important sources of information related to biological processes and complex metabolic functions of the cell. The presence of...
Lcs-trim: Dynamic programming meets xml indexing and querying (2007)
Shirish Tatikonda, Srinivasan Parthasarathy, Matthew Goyder
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the queries and the data...
Resource Allocation in Networked and Distributed Environments (2006)
A central challenge in networked and distributed systems is resource management: how can we partition the available resources in the system across competing users, such that individual users are...
Resource Allocation in Networked and Distributed Environments (2006)
A central challenge in networked and distributed systems is resource management: how can we partition the available resources in the system across competing users, such that individual users are...
Resource allocation in networked and distributed environments [electronic resource] / (2006)
Thesis research directed by: Computer Science.
Resource allocation in networked and distributed environments (2006)
Thesis (Ph. D.) -- University of Maryland, College Park, 2006.
Fast mining of distance-based outliers in high dimensional datasets (2006)
Amol Ghoting, Srinivasan Parthasarathy, Matthew Eric Otey
Defining outliers by their distance to neighboring data points has been shown to be an effective non-parametric approach to outlier detection. Existing algorithms for mining distance-based outliers...
Fast mining of distance-based outliers in high dimensional datasets (2006)
Amol Ghoting, Srinivasan Parthasarathy, Matthew Eric Otey
Defining outliers by their distance to neighboring data points has been shown to be an effective non-parametric approach to outlier detection. Existing algorithms for mining distance-based outliers...
Dependent rounding and its applications to approximation algorithms (2006)
Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan
Abstract We develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading...
Fast distributed outlier detection in mixed-attribute data sets (2006)
Matthew Eric Otey, Amol Ghoting, Srinivasan Parthasarathy
Efficiently detecting outliers or anomalies is an important problem in many areas of science, medicine and information technology. Applications range from data cleaning to clinical diagnosis, from...
Knowledge-conscious exploratory data clustering (2006)
Amol Ghoting, Srinivasan Parthasarathy
Abstract. We consider the problem of efficiently executing data clustering queries in a client-server setting. Specifically, we consider an environment in which the entire data set is housed on a...
An ensemble approach for clustering scalefree graphs (2006)
Sitaram Asur, Srinivasan Parthasarathy, Duygu Ucar
Several real-world networks of interest, such as social and biological networks, are modular in nature. Most of these networks also possess the scale-free property, which makes the task of detecting...
Structurebased querying of proteins using wavelets (2006)
Keith Marsolo, Srinivasan Parthasarathy
The ability to retrieve molecules based on structural similarity has use in many applications, from disease diagnosis and treatment to drug discovery and design. In this paper, we present a method to...
Dependent rounding and its applications to approximation algorithms (2006)
Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan
We develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading to...
Structurebased querying of proteins using wavelets (2006)
Keith Marsolo, Srinivasan Parthasarathy
The ability to retrieve molecules based on structural similarity has use in many applications, from disease diagnosis and treatment to drug discovery and design. In this paper, we present a method to...
International Workshop on Parallel Data Mining (2006)
In Conjunction Ecml/pkdd, Michael R. Berthold, Srinivasan Parthasarathy
Proceedings of the
A model-based approach for mining membrane protein crystallization trials (2006)
Asur, Sitaram, Raman, Pichai, Otey, Matthew Eric, Parthasarathy, Srinivasan
Motivation: Membrane proteins are known to play crucial roles in various cellular functions. Information about their function can be derived from their structure, but knowledge of these proteins is...
Containment Policies for Transmissible Diseases (2006)
Shirish Tatikonda, Sameep Mehta, Srinivasan Parthasarathy
Till date, there have been several cases of H5N1 influenza virus outbreak in avian populations. It is speculated that the mutations in highly unstable influenza virus represents a serious...
Mining spatial object associations for scientific data (2005)
Hui Yang, Srinivasan Parthasarathy, Sameep Mehta
In this paper, we present efficient algorithms to discover spatial associations among features extracted from scientific datasets. In contrast to previous work in this area, features are modeled as...
Duygu Ucar, Srinivasan Parthasarathy, Sitaram Asur, Chao Wang
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) networks wherein each...
A multilevel approach to scop fold recognition (2005)
Keith Marsolo, Srinivasan Parthasarathy
The classification of proteins based on their structure can play an important role in the deduction or discovery of protein function. However, the relatively low number of solved protein structures...
Cache-conscious frequent pattern mining on a modern processor (2005)
Amol Ghoting, Gregory Buehrer, Srinivasan Parthasarathy, Daehyun Kim, Anthony Nguyen, Yen-kuang Chen, ...
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern mining implementations,...
Towards association based spatio-temporal reasoning (2005)
Hui Yang, Srinivasan Parthasarathy, Sameep Mehta
Keywords:Spatio-temporal reasoning, Spatio-temporal object association, Scientific data mining In this paper, we present an association based approach towards spatio-temporal reasoning on scientific...
Approximation algorithms for scheduling on multiple machines (2005)
We develop a single rounding algorithm for scheduling on unrelated parallel machines; this algorithm works well with the known linear programming-, quadratic programming-, and convex...
A characterization of data mining algorithms on a modern processor (2005)
Amol Ghoting, Gregory Buehrer, Srinivasan Parthasarathy, Daehyun Kim, Anthony Nguyen, Yen-kuang Chen, ...
In this paper, we characterize the performance and memory access behavior of several data mining algorithms. Specifically, we consider algorithms for frequent itemset mining, sequence mining, graph...
In Bioinformatics, Srinivasan Parthasarathy, Wei Wang, Mohammed Zaki, Srinivasan Parthasarathy
Workshop
A generalized framework for mining spatio-temporal patterns in scientific data (2005)
Hui Yang, Srinivasan Parthasarathy, Sameep Mehta
In this paper, we present a general framework to discover spatial associations and spatio-temporal episodes for scientific datasets. In contrast to previous work in this area, features are modeled as...
Similarity searching in peer-to-peer databases (2005)
Indrajit Bhattacharya, Srinivas R. Kashyap, Srinivasan Parthasarathy
We consider the problem of handling similarity queries in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the set of objects in...
Cache-conscious Frequent Pattern Mining on a Modern (2005)
Processor Amol Ghoting, Amol Ghoting, Gregory Buehrer, Srinivasan Parthasarathy, Daehyun Kim, Anthony Nguyen, ...
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern mining implementations,...
Dynamic classification of defect structures in molecular dynamics simulation data (2005)
Sameep Mehta, Steve Barr, Alex Choy, Hui Yang, Srinivasan Parthasarathy, Raghu Machiraju, ...
In this application paper we explore techniques to classify anomalous structures (defects) in data generated from Molecular Dynamics (MD) simulations of Silicon (Si) atom systems. These systems are...
Similarity searching in peer-to-peer databases (2005)
Indrajit Bhattacharya, Srinivas R. Kashyap, Srinivasan Parthasarathy
We consider the problem of handling similarity queries in peer-to-peer databases. We propose an indexing and searching mechanism which, given a query object, returns the set of objects in the...
Similarity Searching in Peer-to-Peer Databases (2004)
Bhattacharya, Indrajit, Kashyap, Srinivas R., Parthasarathy, Srinivasan
We consider the problem of handling "similarity queries" in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the set of objects in...
Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks (2004)
Parthasarathy, Srinivasan, Gandhi, Rajiv
We present the first distributed algorithms for computing connected dominating sets (CDS) for ad hoc networks that break the linear-time barrier. We present two algorithms which require O(Delta...
Similarity Searching in Peer-to-Peer Databases (2004)
Bhattacharya, Indrajit, Kashyap, Srinivas R., Parthasarathy, Srinivasan
We consider the problem of handling "similarity queries" in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the set of objects in...
Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks (2004)
Parthasarathy, Srinivasan, Gandhi, Rajiv
We present the first distributed algorithms for computing connected dominating sets (CDS) for ad hoc networks that break the linear-time barrier. We present two algorithms which require O(Delta...
Discovering spatial relationships between approximately equivalent patterns (2004)
Hui Yang, Keith Marsolo, Srinivasan Parthasarathy, Sameep Mehta
A new approach to protein structure mining and alignment (2004)
Hongyuan Li, Keith Marsolo, Srinivasan Parthasarathy, Dmitrii Polshakov
One of the largest areas of bioinformatic and data mining research has been in the protein domain. These efforts have included protein structure prediction, folding pathway prediction, sequence...
Discovering spatial relationships between approximately equivalent patterns (2004)
Hui Yang, Keith Marsolo, Srinivasan Parthasarathy, Sameep Mehta
We present a method for finding relationships between approximate patterns in contact maps. We examine contact maps generated from protein data in order to discover spatial relationships among the...
Distributed algorithms for coloring and domination in wireless ad hoc networks (2004)
Srinivasan Parthasarathy, Rajiv G
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of Unit Disk Graphs...
Loaded: Link-based outlier and anomaly detection in evolving data sets (2004)
Amol Ghoting, Matthew Eric Otey, Srinivasan Parthasarathy, The Ohio
Detecting outliers or anomalies efficiently is an important problem in many areas of science, medicine and information technology. Applications range from data cleaning to fraud and intrusion...
Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks (2004)
Srinivasan Parthasarathy, Rajiv Gandhi
We present the first distributed algorithms for computing connected dominating sets (CDS) for ad hoc networks that break the linear-time barrier. We present two algorithms which require O(\Delta...
Parallel and distributed methods for incremental frequent itemset mining (2004)
Matthew Eric Otey, Srinivasan Parthasarathy, Chao Wang, Adriano Veloso, Wagner Meira
Abstract—Traditional methods for data mining typically make the assumption that the data is centralized, memory-resident, and static. This assumption is no longer tenable. Such methods waste...
A new approach to protein structure mining and alignment (2004)
Hongyuan Li, Keith Marsolo, Srinivasan Parthasarathy, Dmitrii Polshakov
Discovering spatial relationships between approximately equivalent patterns (2004)
Hui Yang, Keith Marsolo, Srinivasan Parthasarathy, Sameep Mehta
Parallel Algorithms for Mining Frequent Structural Motifs in Scientific Data (2004)
Chao Wang, Srinivasan Parthasarathy
Discovery of important substructures from molecules is an important data mining problem. The basic motivation is that the structure of a molecule has a role to play in its biochemical function. There...
Detection and visualization of anomalous structures in molecular dynamics simulation data (2004)
Sameep Mehta, Computer Science, Kaden Hazzard, Srinivasan Parthasarathy, John Wilkins
Figure 1: Si system with a tri-interstitial defect (dataset I1) (a) Lattice with bulk and defect (b) Salient Iso-surface with ability to distinguish between bulk and defect (c) An arbitrary slice of...
Adriano Alonso Veloso, Wagner Meira Jr., Srinivasan Parthasarathy
Mining distributed databases is emerging as a fundamental computational problem. A common approach for mining distributed databases is to move all of the data from each database to a central site and...
Minimizing broadcast latency and redundancy in ad hoc networks (2003)
Srinivasan Parthasarathy, Arunesh Mishra
z
A slacker coherence protocol for pullbased monitoring of on-line data sources (2003)
Radhakrishnan Sundaresan, Tahsin Kurc, Mario Lauria, Srinivasan Parthasarathy, Joel Saltz
An increasing number of online applications operate on data from disparate, and often wide-spread, data sources. This paper studies the design of a system for the automated monitoring of on-line data...
Feature mining paradigms for scientific data (2003)
Ming Jiang, Tat-sang Choy, Sameep Mehta, Matt Coatney, Steve Barr, Kaden Hazzard, ...
Adriano A. Veloso, Srinivasan Parthasarathy
Mining distributed databases is emerging as a fundamental computational problem. A common approach for mining distributed databases is to move all of the data from each database to a central site and...
Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks (2003)
Rajiv Gandhi, Srinivasan Parthasarathy, Arunesh Mishra
wideb roadcasting is a fundamental operation in ad hoc networks.
Mining distributed databases is emerging as a fundamental computational problem. A common approach for mining distributed databases is to move all of the data from each database to a central site and...
On the Use of Conceptual Reconstruction for Mining Massively (2003)
Incomplete Data Sets, Srinivasan Parthasarathy, Charu C. Aggarwal
Incomplete data sets have become almost ubiquitous in a wide variety of application domains.
Parallel and distributed frequent itemset mining on dynamic datasets (2003)
Adriano Veloso, Matthew Erick Otey, Srinivasan Parthasarathy, Wagner Meira
Abstract Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/O...
Feature mining paradigms for scientific data (2003)
Ming Jiang, Tat-sang Choy, Sameep Mehta, Matt Coatney, Steve Barr, Kaden Hazzard, ...
Parallel and Distributed Frequent Itemset Mining on Dynamic Datasets (2003)
Adriano Veloso, Matthew Erick Otey, Srinivasan Parthasarathy, Wagner Meira Jr.
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/O resources when...
Adriano A. Veloso, Wagner Meira, Srinivasan Parthasarathy
Mining distributed databases is emerging as a fundamental computational problem. A common approach for mining distributed databases is to move all of the data from each database to a central site and...
Feature mining paradigms for scientific data (2003)
Ming Jiang, Tat-sang Choy, Sameep Mehta, Matt Coatney, Steve Barr, Kaden Hazzard, ...
Shared State for Distributed Interactive Data Mining Applications (2002)
Srinivasan Parthasarathy, Sandhya Dwarkadas
Distributed data mining applications involving user interaction are now feasible due to advances in processor speed and network bandwidth. These applications are traditionally implemented using...
Efficient Discovery of Common Substructures in Macromolecules (2002)
Srinivasan Parthasarathy And, Srinivasan Parthasarathy, Matt Coatney
Biological macromolecules play a fundamental role in disease; therefore, they are of great interest to fields such as pharmacology and chemical genomics. Yet due to macromolecules ' complexity,...
Parallel Incremental 2D-Discretization on Dynamic Datasets (2002)
Srinivasan Parthasarathy, Arun Ramakrishnan
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Such approaches can...
On the Use of Constrained Associations for Web Log Mining (2002)
Hui Yang, Srinivasan Parthasarathy, Sandeep Reddy, Eep Reddy
this paper, we first present an approach based on association rule mining. Our algorithm discovers association rules that are constrained (and ordered) temporally. The approach relies on the simple...
Efficient Progressive Sampling for Association Rules (2002)
In data mining, sampling has often been suggested as an effective tool to reduce the size of the dataset operated at some cost to accuracy. However, this loss to accuracy is often difficult to...
A Protocol for Scalable Application Layer Multicast (2001)
Banerjee, Suman, Bhattacharjee, Bobby, Parthasarathy, Srinivasan
We describe a new application-layer multicast protocol that is specifically designed to scale to large groups. Our scheme is based upon a hierarchical clustering of the application-layer multicast...
A Protocol for Scalable Application Layer Multicast (2001)
Banerjee, Suman, Bhattacharjee, Bobby, Parthasarathy, Srinivasan
We describe a new application-layer multicast protocol that is specifically designed to scale to large groups. Our scheme is based upon a hierarchical clustering of the application-layer multicast...
MARCO: MARyland browser COno/guration (2001)
Vijay Gopalakrishnan, Srinivasan Parthasarathy
based testing tool
S-DSM for Heterogeneous Machine Architectures (2001)
Eduardo Pinheiro, Deqing Chen, Hya Dwarkadas, Srinivasan Parthasarathy, Michael L. Scott
Many---indeed most---distributed applications employ some notion of distributed shared state: information required at more than one location. For applications that span the Internet, this state is...
Towards Network-Aware Data Mining (2001)
Distributed data mining algorithms executing on a shared network of workstations often suffer from unpredictable performance problems due to limited network resources that are being shared. We show...
Mining Massively Incomplete Data Sets by Conceptual Reconstruction (2001)
Charu C. Aggarwal, Srinivasan Parthasarathy
Incomplete data sets have become almost ubiquitous in a wide variety of application domains. Common examples can be found in climate and image data sets, sensor data sets and medical data sets. The...
Mining Massively Incomplete Data Sets by Conceptual Reconstruction (2001)
Charu C. Aggarwal, Srinivasan Parthasarathy
Incomplete data sets have become almost ubiquitous in a wide variety of application domains. Common examples can be found in climate and image data sets, sensor data sets and medical data sets. The...
S-DSM for Heterogeneous Machine Architectures (2001)
Eduardo Pinheiro, Deqing Chen, Hya Dwarkadas, Srinivasan Parthasarathy, Michael L. Scott
Many---indeed most---distributed applications employ some notion of distributed shared state: information required at more than one location. For applications that span the Internet, this state is...
Deriving Multi-level Protein Structures Through Data Mining (2001)
Hongyuan Li Srinivasan, Srinivasan Parthasarathy
Proteins are molecules with different levels of repeated structures or patterns. These patterns are of great interest to biochemists since their identification can enhance the study of protein...
Abstract S-DSM for Heterogeneous Machine Architectures (2000)
Eduardo Pinheiro, Deqing Chen, Hya Dwarkadas, Srinivasan Parthasarathy, Michael L. Scott
Many—indeed most—distributed applications employ some notion of distributed shared state: information required at more than one location. For applications that span the Internet, this state is...
InterWeave: A Middleware System for Distributed Shared State (2000)
Deqing Chen, Hya Dwarkadas, Srinivasan Parthasarathy, Eduardo Pinheiro, Michael L. Scott
As an alternative to message passing, Rochester's InterWeave system allows the programmer to map shared segments into programs spread across heterogeneous, distributed machines. InterWeave...
Clustering distributed homogeneous datasets (2000)
Srinivasan Parthasarathy, Mitsunori Ogihara
Abstract. In this paper we present an elegant and effective algorithm for measuring the similarity between homogeneous datasets to enable clustering. Once similar datasets are clustered, each cluster...
InterWeave: A Middleware System for Distributed Shared State (2000)
Deqing Chen, Hya Dwarkadas, Srinivasan Parthasarathy, Eduardo Pinheiro, Michael L. Scott
Abstract. As an alternative to message passing, Rochester's InterWeave system allows the programmer to map shared segments into programs spread across heterogeneous, distributed machines....
InterWeave: A Middleware System for Distributed Shared State (2000)
Deqing Chen, Sandhya Dwarkadas, Hya Dwarkadas, Srinivasan Parthasarathy, Eduardo Pinheiro, Michael L. Scott
. As an alternative to message passing, Rochester's InterWeave system allows the programmer to map shared segments into programs spread across heterogeneous, distributed machines. InterWeave...
InterWeave: A Middleware System for Distributed Shared State (2000)
Deqing Chen Sandhya, Deqing Chen, Hya Dwarkadas, Srinivasan Parthasarathy, Eduardo Pinheiro, Michael L. Scott
As an alternative to message passing, Rochester's InterWeave system allows the programmer to map shared segments into programs spread across heterogeneous, distributed machines. InterWeave...
S-DSM for Heterogeneous Machine Architectures (2000)
Eduardo Pinheiro Deqing, Eduardo Pinheiro, Deqing Chen, Hya Dwarkadas, Srinivasan Parthasarathy, Michael L. Scott
Many---indeed most---distributed applications employ some notion of distributed shared state: information required at more than one location. For applications that span the Internet, this state is...
Computing and Data Stream Processing Systems (2000)
Advisor Prof, Srinivasan Parthasarathy, Work Experience
Computing. I am particularly interested in Architectures, Query Processing and Data Mining in the context
The Implementation of Cashmere (1999)
Stets Jr., Robert J., Chen, DeQing, Dwarkadas, Sandhya, Hardavellas, Nikolaos, Hunt, Galen C., Kontothanassis, Leonidas I., ...
Cashmere is a software distributed shared memory (SDSM) system designed for today's high-performance cluster architectures. These clusters typically consist of symmetric multiprocessors (SMPs)...
InterAct: Virtual Sharing for Interactive Client-Server Applications (1998)
Srinivasan Parthasarathy, Sandhya Dwarkadas, Hya Dwarkadas
. We describe InterAct, a framework for interactive clientserver applications. InterAct provides an efficient mechanism to support object sharing while facilitating client-controlled consistency....
Memory Placement Techniques for Parallel Association Mining (1998)
Srinivasan Parthasarathy, Mohammed J. Zaki, Wei Li
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data locality. In the...
InterAct: Virtual Sharing for Interactive Client-Server Applications (1998)
Srinivasan Parthasarathy, Hya Dwarkadas
Abstract. We describe InterAct, a framework for interactive clientserver applications. InterAct provides an efficient mechanism to support object sharing while facilitating client-controlled...
Memory placement techniques for parallel association mining (1998)
Srinivasan Parthasarathy, Mohammed J. Zaki, Wei Li
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data locality. In the...
Custom Memory Placement for Parallel Data Mining (1997)
Parthasarathy, Srinivasan, Zaki, Mohammed Javeed, Li, Wei
A lot of data mining tasks, such as Associations, Sequences, and Classification, use complex pointer-based data structures that typically suffer from sub-optimal locality. In the multi-processor case...
CASHMERE-2L: Software Coherent Shared Memory on a Clustered Remote-Write Network (1997)
Stets, Robert J., Dwarkadas, Sandhya, Hardavellas, Nikolaos, Hunt, Galen C., Kontothanassis, Leonidas I., Parthasarathy, Srinivasan, ...
Link to Published Version: http://portal.acm.org/ft_gateway.cfm?id=266675&type=pdf&coll=portal&dl=ACM&CFID=42864832&CFTOKEN=38189388
New Algorithms for Fast Discovery of Association Rules (1997)
Zaki, Mohammed Javeed, Parthasarathy, Srinivasan, Ogihara, Mitsunori, Li, Wei
Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets, and then forming...
VM-Based Shared Memory on Low-Latency, Remote-Memory-Access Networks (1997)
Kontothanassis, Leonidas I., Hunt, Galen C., Stets, Robert, Hardavellas, Nikolaos, Cierniak, Michal, Parthasarathy, Srinivasan, ...
Link to published version: http://ieeexplore.ieee.org/iel3/4807/13287/00604674.pdf?tp=&arnumber=604674&isnumber=13287
Arithmetic and Logic Operations with DNA (1997)
Gupta, Vineet, Parthasarathy, Srinivasan, Zaki, Mohammed Javeed
First published in the proceedings of the third DIMACS workshop: DNA Based Computers III, in the series DIMACS: Series in Discrete Mathematics and Theoretical Computer Science vol. 48, published by...
Evaluation of Sampling for Data Mining of Association Rules. (1997)
Zaki, Mohammed J., Parthasarathy, Srinivasan, Li, Wei, Ogihara, Mitsunori
Data mining is an emerging research area, whose goal is to extract significant patterns or interesting rules from large databases. High-level inference from large volumes of routine business data can...
Arithmetic and Logic Operations with DNA (1997)
Gupta, Vineet, Parthasarathy, Srinivasan, Zaki, Mohammed Javeed
The use of DNA molecules to solve hard computational problems has been demonstrated in recent studies. However, the question of suitability of DNA for solving simple computer operations, such as...
Cashmere-2L: Software Coherent Shared Memory on a Clustered Remote-Write Network (1997)
Robert Stets, Hya Dwarkadas, Nikolaos Hardavellas, Galen Hunt, Leonidas Kontothanassis, Srinivasan Parthasarathy, ...
Low-latency remote-write networks, such as DEC’s Memory Channel, provide the possibility of transparent, inexpensive, large-scale shared-memory parallel computing on clusters of shared memory...
Evaluation of sampling for data mining of association rules (1997)
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Wei Li, Mitsunori Ogihara
Discovery of association rules is a prototypical problem in data mining. The current algorithms proposed for data mining of association rules make repeated passes over the database to determine the...
Customized dynamic load balancing for a network of workstations (1997)
Mohammed Javeed Zaki, Wei Li, Srinivasan Parthasarathy
Load balancing involves assigning to each processor, work proportional to its performance, minimizing the execution time of the program. Although static load balancing can solve many problems (e.g.,...
A localized algorithm for parallel association mining (1997)
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Wei Li
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules from them. Several...
Cashmere-2L: Software Coherent Shared Memory on a Clustered Remote-Write Network (1997)
Robert Stets, Hya Dwarkadas, Nikolaos Hardavellas, Galen Hunt, Leonidas Kontothanassisy, Srinivasan Parthasarathy, ...
Low-latency remote-write networks, such as DEC’s Memory Channel, provide the possibility of transparent, inexpensive, large-scale shared-memory parallel computing on clusters of shared memory...
Customized dynamic load balancing for a network of workstations (1997)
Mohammed Javeed Zaki, Wei Li, Srinivasan Parthasarathy
Load balancing involves assigning to each processor, work proportional to its performance, minimizing the execution time of the program. Although static load balancing can solve many problems (e.g.,...
Cashmere-2L: Software Coherent Shared Memory on a Clustered Remote-Write Network (1997)
Robert Stets, Hya Dwarkadas, Nikolaos Hardavellas, Galen Hunt, Leonidas Kontothanassis, Srinivasan Parthasarathy, ...
Low-latency remote-write networks, such as DEC's Memory Channel, provide the possibility of transparent, inexpensive, large-scale shared-memory parallel computing on clusters of shared memory...
New Algorithms for Fast Discovery of Association Rules (1997)
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, Wei Li
Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets, and then forming...
Cashmere-2L: Software Coherent Shared Memory on a Clustered Remote-Write Network (1997)
Robert Stets, Sandhya Dwarkadas, Hya Dwarkadas, Nikolaos Hardavellas, Galen Hunt, Leonidas Kontothanassis, ...
Low-latency remote-write networks, such as DEC's Memory Channel, provide the possibility of transparent, inexpensive, large-scale shared-memory parallel computing on clusters of shared memory...
VM-Based Shared Memory on Low-Latency, Remote-Memory-Access Networks (1997)
Leonidas Kontothanassis, Galen Hunt, Robert Stets, Nikolaos Hardavellas, Michal Cierniak, Srinivasan Parthasarathy, ...
Recent technological advances have produced network interfaces that provide users with very low-latency access to the memory of remote machines. We examine the impact of such networks on the...
A Localized Algorithm for Parallel Association Mining (1997)
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Wei Li
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules from them. Several...
Arithmetic and Logic Operations with DNA (1997)
Vineet Gupta, Srinivasan Parthasarathy, Mohammed J. Zaki
The use of DNA molecules to solve hard computational problems has been demonstrated in recent studies. However, the question of suitability of DNA for solving simple computer operations, such as...
VM-Based Shared Memory on Low-Latency, Remote-Memory-Access Networks (1997)
Leonidas Kontothanassis, Galen Hunt, Robert Stets, Nikolaos Hardavellas, Michal Cierniak, Srinivasan Parthasarathy, ...
Recent technological advances have produced network interfaces that provide users with very low-latency access to the memory of remote machines. We examine the impact of such networks on the...
VM-Based Shared Memory on Low-Latency, Remote-Memory-Access Networks (1997)
Leonidas Kontothanassis, Galen Hunt, Robert Stets, Nikolaos Hardavellas, Michal Cierniak, Srinivasan Parthasarathy, ...
Recent technological advances have produced network interfaces that provide users with very low-latency access to the memory of remote machines. We examine the impact of such networks on the...
New Algorithms for Fast Discovery of Association Rules (1997)
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, Wei Li
Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets, and then forming...
Arithmetic and Logic Operations with DNA (1997)
Vineet Gupta, Srinivasan Parthasarathy, Mohammed J. Zaki
A lot of current research in DNA computing has been directed towards solving difficult combinatorial search problems. However, for DNA computing to be applicable on a wider range of problems, support...
VM-Based Shared Memory on Low-Latency, Remote-Memory-Access Networks (1997)
Leonidas Kontothanassis, Galen Hunt, Robert Stets, Nikolaos Hardavellas, Michał Cierniak, Srinivasan Parthasarathy, ...
Recent technological advances have produced network interfaces that provide users with very low-latency access to the memory of remote machines. We examine the impact of such networks on the...
Cashmere-2L: Software Coherent Shared Memory on a Clustered Remote-Write Network (1997)
Robert Stets, Hya Dwarkadas, Nikolaos Hardavellas, Galen Hunt, Leonidas Kontothanassisy, Srinivasan Parthasarathy, ...
Low-latency remote-write networks, such as DEC’s Memory Channel, provide the possibility of transparent, inexpensive, large-scale shared-memory parallel computing on clusters of shared memory...
A localized algorithm for parallel association mining (1997)
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Wei Li
Discovery of association rules is an important database mining problem. Mining forassociation nrlesinvolves extracting patterns from large databases and inferring useful rules from them. Several...
New Algorithms for Fast Discovery of Association Rules (1997)
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, Wei Li
Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets, and then forming...
Evaluation of sampling for data mining of association rules (1997)
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Wei Li, Mitsunori Ogihara
Discovery of association rules is a prototypical problem in data mining. The current algorithms proposed for data mining of association rules make repeated passes over the database to determine the...
VM-Based Shared Memory on Low-Latency, Remote-Memory-Access Networks (1996)
Kontothanassis, Leonidas I., Hunt, Galen C., Stets Jr., Robert J., Hardavellas, Nikolaos, Cierniak, Michal, Parthasarathy, Srinivasan, ...
Recent technological advances have produced network interfaces that provide users with very low-latency access to the memory of remote machines. We examine the impact of such networks on the...
Evaluation of Sampling for Data Mining of Association Rules (1996)
Zaki, Mohammed Javeed, Parthasarathy, Srinivasan, Li, Wei, Ogihara, Mitsunori
Data mining is an emerging research area, whose goal is to extract significant patterns or interesting rules from large databases. High-level inference from large volumes of routine business data can...
Parallel Data Mining for Association Rules on Shared-Memory Multiprocessors (1996)
Zaki, Mohammed Javeed, Ogihara, Mitsunori, Parthasarathy, Srinivasan, Li, Wei
Data mining is an emerging research area, whose goal is to extract significant patterns or interesting rules from large databases. High-level inference from large volumes of routine business data can...
NetProf: Network-Based High-Level Profiling of Java Bytecode (1996)
Parthasarathy, Srinivasan, Cierniak, Michal, Li, Wei
In this paper we present a system for network based visualization of profile information generated by Java applets/bytecode. The system, called NetProf, is composed of several components each of...
Parallel data mining for association rules on shared-memory multi-processors (1996)
Srinivasan Parthasarathy, Mohammed J. Zaki, Mitsunori Ogihara, Wei Li
In this paper we present a new parallel algorithm for data mining of association rules on sharedmemory multiprocessors. We study the degree of parallelism, synchronization, and data locality issues,...
Compile-time inter-query dependence analysis (1996)
Srinivasan Parthasarathy, Wei Li, Mohammed Javeed Zaki
Most parallel databases exploit two types of parallelism: intra-query parallelism and inter-transaction concurrency. Between these two cases lies another type of parallelism: inter-query parallelism...
NetProf: Network-based High-level Profiling of Java Bytecode (1996)
Srinivasan Parthasarathy, Michal Cierniak, Wei Li
In this paper we present a system for network based visualization of profile information generated by Java applets/bytecode. The system, called NetProf, is composed of several components each of...
Compile-time Inter-query Dependence Analysis (1996)
Srinivasan Parthasarathy, Wei Li, Michal Cierniak, Mohammed Javeed Zaki
Most parallel databases exploit two types of parallelism: intra-query parallelism and inter-transaction concurrency. Between these two cases lies another type of parallelism: inter-query parallelism...
An Efficient Algorithm for Concurrent Priority Queue Heaps (1996)
Galen C. Hunt, Maged M. Michael, Srinivasan Parthasarathy, Michael L. Scott
We present a new algorithm for concurrent access to array-based priority queue heaps. Deletions proceed top-down as they do in a previous algorithm due to Rao and Kumar [6], but insertions proceed...
Evaluation of Sampling for Data Mining of Association Rules (1996)
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Wei Li, Mitsunori Ogihara
Data mining is an emerging research area, whose goal is to extract significant patterns or interesting rules from large databases. High-level inference from large volumes of routine business data can...
An Efficient Algorithm for Concurrent Priority Queue Heaps (1996)
Galen Hunt, Maged M. Michael, Srinivasan Parthasarathy, Michael L. Scott
We present a new algorithm for concurrent access to array-based priority queue heaps. Deletions proceed top-down as they do in a previous algorithm due to Rao and Kumar [7], but insertions proceed...
Customized Dynamic Load Balancing for a Network of Workstations (1995)
Zaki, Mohammed Javeed, Li, Wei, Parthasarathy, Srinivasan
Load balancing involves assigning to each processor, work proportional to its performance, minimizing the execution time of the program. Although static load balancing can solve many problems (e.g.,...
Compile-Time Inter-Query Dependence Analysis (1995)
Parthasarathy, Srinivasan, Li, Wei, Cierniak, Michal, Zaki, Mohammed Javeed
Most parallel databases exploit two types of parallelism: intra-query parallelism and inter-transaction concurrency. Between these two cases lies another type of parallelism: inter-query parallelism...
Customized Dynamic Load Balancing for a Network of Workstations (1995)
Mohammed Javeed, Mohammed Javeed Zaki, Wei Li, Srinivasan Parthasarathy
Load balancing involves assigning to each processor, work proportional to its performance, minimizing the execution time of the program. Although static load balancing can solve many problems (e.g.,...
Customized Dynamic Load Balancing for a Network of Workstations (1995)
Mohammed Javeed Zaki, Wei Li, Srinivasan Parthasarathy
Load balancing involves assigning to each processor work proportional to its performance, thereby minimizing the execution time of the program. Although static load balancing can solve many problems...
An Efficient Algorithm for Concurrent Priority Queue Heaps (1994)
Hunt, Galen C., Michael, Maged M., Parthasarathy, Srinivasan, Scott, Michael L.
We present a new algorithm for concurrent access to array-based priority queue heaps. Deletions proceed top-down as they do in a previous algorithm due to Rao and Kumar [1988 (IEEE Trans. Computers...
The banker's algorithm : a deadlock-free resource allocation strategy for concurra / (1994)
Thesis (M.S.)--University of Cincinnati, 1994.
A matrix quantizer incorporating the human visual model /--by Srinivasan Parthasarathy. (1985)
Thesis (M.S.)--San Diego State University, 1985.
A spatio-temporal mining approach towards summarizing and analyzing protein folding trajectories
Yang, Hui, Parthasarathy, Srinivasan, Ucar, Duygu
Understanding the protein folding mechanism remains a grand challenge in structural biology. In the past several years, computational theories in molecular dynamics have been employed to shed light...
Predicting functionality of protein–DNA interactions by integrating diverse evidence
Ucar, Duygu, Beyer, Andreas, Parthasarathy, Srinivasan, Workman, Christopher T.
Chromatin immunoprecipitation (ChIP-chip) experiments enable capturing physical interactions between regulatory proteins and DNA in vivo. However, measurement of chromatin binding alone is not...