Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Pinar, Ali - Sandia National Laboratories
Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains
Latent Clustering on Graphs with Multiple Edge Types Matthew Rocklin1 and Ali Pinar2
Job Opening Created:9 June 2011 POSITION: Postdoctoral Appointee-Computer Science/Applied Mathematics Researcher
PARTITIONING HYPERGRAPHS IN SCIENTIFIC COMPUTING APPLICATIONS THROUGH VERTEX SEPARATORS ON GRAPHS
SIAM J. OPTIM. c 2010 Society for Industrial and Applied Mathematics Vol. 20, No. 4, pp. 17861810
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1 Communication Requirements and Interconnect
ForPeerReview Constructing and Sampling Graphs with a Prescribed Joint
Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types
A (n) Approximation Algorithm for 2-Dimensional Vector Packing
On Clustering on Graphs with Multiple Edge Types Matthew Rocklin Ali Pinar
mpiserver kernel start()
Power System Extreme Event Detection: The Vulnerability Frontier Bernard C. Lesieutre Ali Pinar
An Implicit Optimization Approach for Survivable Network Design
Reconfigurable Hybrid Interconnection for Static and Dynamic Scientific Applications
Power Invariant Vector Sequence Compaction Ali Pinar C. L. Liu
OPTIMIZATION STRATEGIES FOR THE VULNERABILITY ANALYSIS OF THE ELECTRIC POWER GRID
An In-Depth Study of Stochastic Kronecker Graphs C.Seshadhri, Ali Pinar, and Tamara Kolda
PARTITIONING HYPERGRAPHS IN SCIENTIFIC COMPUTING APPLICATIONS THROUGH VERTEX SEPARATORS ON GRAPHS
PERMUTING SPARSE RECTANGULAR MATRICES INTO BLOCK-DIAGONAL FORM
Abstract--We propose a partitioning problem in a power system context that weighs the two objectives of minimizing cuts
N-k-Survivable Power System Design Richard Li-Yang Chen, Amy Cohn, Neng Fan, Ali Pinar
Improving Performance of Sparse Matrix-Vector Multiplication Ali Pinar Michael T. Heath
Combinatorial Parallel and Scientific
Constructing and Sampling Graphs with a Prescribed Joint Degree Distribution
Exploiting Flexibly Assignable Work to Improve Load Balance
Fast Optimal Load Balancing Algorithms for 1D Partitioning Ali Pinar Cevdet Aykanat
Sparse Matrix Decomposition with Optimal Load Balancing Ali Pinar and Cevdet Aykanat
Partitioning for Complex Objectives Dept. of Computer Science
eScholarship provides open access, scholarly publishing services to the University of California and delivers a dynamic
Compressing Bitmap Indices by Data Reorganization Computational Research Division
COMBINATORIAL ALGORITHMS FOR COMPUTING COLUMN SPACE BASES THAT HAVE SPARSE INVERSES
