Sciweavers

2814 search results - page 219 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
97
Voted
IPPS
2008
IEEE
15 years 7 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
ICPP
2006
IEEE
15 years 6 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
HIPC
2009
Springer
14 years 10 months ago
Detailed analysis of I/O traces for large scale applications
- In this paper, we present a tool to extract I/O traces from very large applications running at full scale during their production runs. We analyze these traces to gain informatio...
Nithin Nakka, Alok N. Choudhary, Wei-keng Liao, Le...
SAC
2006
ACM
15 years 6 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
113
Voted
PR
2008
161views more  PR 2008»
15 years 20 days ago
A study on three linear discriminant analysis based methods in small sample size problem
In this paper, we make a study on three Linear Discriminant Analysis (LDA) based methods: Regularized Discriminant Analysis (RDA), Discriminant Common Vectors (DCV) and Maximal Ma...
Jun Liu, Songcan Chen, Xiaoyang Tan