Sciweavers

242 search results - page 23 / 49
» Finding effective compilation sequences
Sort
View
PPOPP
2009
ACM
14 years 8 months ago
Comparability graph coloring for optimizing utilization of stream register files in stream processors
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
Xuejun Yang, Li Wang, Jingling Xue, Yu Deng, Ying ...
RECOMB
2006
Springer
14 years 8 months ago
Integrated Protein Interaction Networks for 11 Microbes
We have combined four different types of functional genomic data to create high coverage protein interaction networks for 11 microbes. Our integration algorithm naturally handles s...
Balaji S. Srinivasan, Antal F. Novak, Jason Flanni...
VLDB
2007
ACM
121views Database» more  VLDB 2007»
14 years 8 months ago
Ranked Subsequence Matching in Time-Series Databases
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
Wook-Shin Han, Jinsoo Lee, Yang-Sae Moon, Haifeng ...
IEEEPACT
2009
IEEE
14 years 2 months ago
Polyhedral-Model Guided Loop-Nest Auto-Vectorization
Abstract—Optimizing compilers apply numerous interdependent optimizations, leading to the notoriously difficult phase-ordering problem — that of deciding which transformations...
Konrad Trifunovic, Dorit Nuzman, Albert Cohen, Aya...
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Processing of Warping Time Series Join of Motion Capture Data
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
Yueguo Chen, Gang Chen, Ke Chen, Beng Chin Ooi