Sciweavers

4305 search results - page 202 / 861
» The Test of Time
Sort
View
FQAS
2004
Springer
146views Database» more  FQAS 2004»
15 years 10 months ago
Discovering Representative Models in Large Time Series Databases
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
Simona E. Rombo, Giorgio Terracina
DAC
2010
ACM
15 years 10 months ago
Representative path selection for post-silicon timing prediction under variability
The identification of speedpaths is required for post-silicon (PS) timing validation, and it is currently becoming timeconsuming due to manufacturing variations. In this paper we...
Lin Xie, Azadeh Davoodi
ASPDAC
2006
ACM
102views Hardware» more  ASPDAC 2006»
16 years 17 days ago
An O(mn) time algorithm for optimal buffer insertion of nets with m sinks
— Buffer insertion is an effective technique to reduce interconnect delay. In this paper, we give a simple O(mn) time algorithm for optimal buffer insertion, where m is the numbe...
Zhuo Li, Weiping Shi
PRL
2008
65views more  PRL 2008»
15 years 6 months ago
Matching of quasi-periodic time series patterns by exchange of block-sorting signatures
We propose a novel method for quasi-periodic time series patterns matching, through signature exchange between the two patterns. The signature is obtained through sorting of the t...
Bachir Boucheham
JCST
2010
128views more  JCST 2010»
15 years 1 months ago
Queue Waiting Time Aware Dynamic Workflow Scheduling in Multicluster Environments
Abstract Workflows are prevailing in scientific computation. Multicluster environments emerge and provide more resources, benefiting workflows but also challenging the traditional ...
Zhi-Feng Yu, Wei-Song Shi