Browsing School of Computational Science and Engineering Technical Reports by Title
Now showing items 1-20 of 37
-
A Better World for All: Understanding and Promoting Micro-finance Activities in Kiva.org
(Georgia Institute of Technology, 2013)Micro-finance organizations provide non-profit loaning opportunities to eradicate poverty by financially equipping impoverished, yet skilled entrepreneurs who are in desperate need of an institution that lends to those ... -
BioPerf: A Benchmark Suite to Evaluate High-Performance Computer Architecture on Bioinformatics Applications
(Georgia Institute of Technology, 2006)The exponential growth in the amount of genomic data has spurred growing interest in large scale analysis of genetic information. Bioinformatics applications, which explore computational methods to allow researchers to ... -
A Cache-Aware Parallel Implementation of the Push-Relabel Network Flow Algorithm and Experimental Evaluation of the Gap Relabeling Heuristic
(Georgia Institute of Technology, 2006-02-25)The maximum flow problem is a combinatorial problem of significant importance in a wide variety of research and commercial applications. It has been extensively studied and implemented over the past 40 years. The ... -
A Comparison of Generalized Linear Discriminant Analysis Algorithms
(Georgia Institute of Technology, 2006-01-28)Linear Discriminant Analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled problems where the number of data samples ... -
Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors
(Georgia Institute of Technology, 2006-02-25)Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing and computational biology, as well as applications in national security. ... -
Designing Irregular Parallel Algorithms With Mutual Exclusion and Lock-free Protocols
(Georgia Institute of Technology, 2006-02-25)Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an irregular application, fine-grained ... -
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
(Georgia Institute of Technology, 2006-02-26)Graph abstractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence in recent years for applications ... -
Detecting Communities from Given Seeds in Social Networks
(Georgia Institute of Technology, 2011-02-22)Analyzing massive social networks challenges both high-performance computers and human under- standing. These massive networks cannot be visualized easily, and their scale makes applying complex analysis methods ... -
An Empirical Analysis of Parallel Random Permutation Algorithms on SMPs
(Georgia Institute of Technology, 2006-02-25)We compare parallel algorithms for random permutation generation on symmetric multiprocessors (SMPs). Algorithms considered are the sorting-based algorithm, Anderson's shuffling algorithm, the dart-throwing algorithm, ... -
ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony
(Georgia Institute of Technology, 2006-02-26)Constructing phylogenetic trees in the study of the evolutionary history of a group organisms is an extremely challenging problem in computational biology. The problem becomes intractable with growing number of organisms. ... -
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
(Georgia Institute of Technology, 2006-02-25)We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connectivity, spanning tree, and tree computations. ... -
Extracting Unrecognized Gene Relationships From the Biomedical Literature via Matrix Factorizations Using a Priori Knowledge of Gene Relationships
(Georgia Institute of Technology, 2006)The construction of literature-based networks of gene-gene interactions is one of the most important applications of text mining in bioinformatics. Extracting potential gene relationships from the biomedical literature ... -
Fast Linear Discriminant Analysis using QR Decomposition and Regularization
(Georgia Institute of Technology, 2007-03-23)Linear Discriminant Analysis (LDA) is among the most optimal dimension reduction methods for classification, which provides a high degree of class separability for numerous applications from science and engineering. ... -
A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs)
(Georgia Institute of Technology, 2006-02-25)The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. Many PRAM algorithms can be adapted to SMPs with ... -
Feature Reduction via Generalized Uncorrelated Linear Discriminant Analysis
(Georgia Institute of Technology, 2006)High-dimensional data appear in many applications of data mining, machine learning, and bioinformatics. Feature reduction is commonly applied as a preprocessing step to overcome the curse of dimensionality. Uncorrelated ... -
Leveraging Memory Mapping for Fast and Scalable Graph Computation on a PC
(Georgia Institute of Technology, 2013-08)Large graphs with billions of nodes and edges are increasingly common, calling for new kinds of scalable computation frameworks. Although popular, distributed approaches can be expensive to build, or require many resources ... -
Mage: Expressive Pattern Matching in Richly-Attributed Graphs
(Georgia Institute of Technology, 2013)Given a large graph with millions of nodes and edges, say a social graph where both the nodes and edges can have multiple different kinds of attributes (e.g., job titles, tie strengths), how do we quickly find matches ... -
MMAP: Mining Billion-Scale Graphs on a PC with Fast, Minimalist Approach via Memory Mapping
(Georgia Institute of Technology, 2013)Large graphs with billions of nodes and edges are increasingly common, calling for new kinds of scalable computation frameworks. State-of-the-art approaches such as GraphChi and TurboGraph recently demonstrated that a ... -
Multiclass Classifiers Based on Dimension Reduction with Generalized LDA
(Georgia Institute of Technology, 2006-01-27)Linear discriminant analysis (LDA) has been widely used for dimension reduction of data sets with multiple classes. The LDA has been recently extended to various generalized LDA methods which are applicable regardless ... -
Non-Negative Matrix Factorization Based on Alternating Non-Negativity Constrained Least Squares and Active Set Method
(Georgia Institute of Technology, 2007)
