535 search results - page 64 / 107 » Predicting Application Run Times Using Historical Informatio... |
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— We propose a packet sampling strategy called fixedperiod sampling, which selects at most one packet in every fixedlength period. Under the fixed-period sampling, the...
108
click to vote
SPIRE
2010
Springer
15 years 10 days ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
108
click to vote
KES
2010
Springer
15 years 12 days ago
2010
Springer
Evolving Takagi Sugeno (eTS) models are optimised for use in applications with high sampling rates. This mode of use produces excellent prediction results very quickly and with lo...
163
click to vote
DEXA
2009
Springer
15 years 5 months ago
2009
Springer
Data intensive applications in Life Sciences extensively use the Hidden Web as a platform for information sharing. Access to these heterogeneous Hidden Web resources is limited thr...
190
click to vote
VLSISP
2011
14 years 9 months ago
2011
Machine-learning algorithms are employed in a wide variety of applications to extract useful information from data sets, and many are known to suffer from superlinear increases in ...