7303 search results - page 336 / 1461 » Optimality for dynamic patterns |
146
click to vote
TRANSCI
2010
14 years 11 months ago
2010
Consider the following game. Given a network with a continuum of users at some origins, suppose that users wish to reach specic destinations, but that they are not indierent to the...
300
click to vote
ICDE
2004
IEEE
16 years 6 months ago
2004
IEEE
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
144
click to vote
HPCA
2002
IEEE
16 years 5 months ago
2002
IEEE
The increasing performance gap between processors and memory will force future architectures to devote significant resources towards removing and hiding memory latency. The two ma...
135
Voted
CSR
2006
Springer
15 years 8 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
160
click to vote
ICPP
2008
IEEE
15 years 11 months ago
2008
IEEE
Despite great efforts on the design of ultra-reliable components, the increase of system size and complexity has outpaced the improvement of component reliability. As a result, fa...