Sciweavers

432 search results - page 70 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
BMCBI
2007
136views more  BMCBI 2007»
14 years 9 months ago
Comparison of protein structures by growing neighborhood alignments
Background: Design of protein structure comparison algorithm is an important research issue, having far reaching implications. In this article, we describe a protein structure com...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
CF
2006
ACM
15 years 3 months ago
A nano-scale reconfigurable mesh with spin waves
In this paper, we present a nano-scale reconfigurable mesh that is interconnected with ferromagnetic spin-wave buses. The architecture described here, while requiring the same num...
Mary Mehrnoosh Eshaghian-Wilner, Alexander Khitun,...
MASCOTS
2010
14 years 11 months ago
Efficient Discovery of Loop Nests in Execution Traces
Execution and communication traces are central to performance modeling and analysis. Since the traces can be very long, meaningful compression and extraction of representative beha...
Qiang Xu, Jaspal Subhlok, Nathaniel Hammen
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
14 years 11 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
IEEEPACT
2007
IEEE
15 years 3 months ago
A Flexible Heterogeneous Multi-Core Architecture
Multi-core processors naturally exploit thread-level parallelism (TLP). However, extracting instruction-level parallelism (ILP) from individual applications or threads is still a ...
Miquel Pericàs, Adrián Cristal, Fran...