16188 search results - page 3099 / 3238 » The Optimal PAC Algorithm |
140
click to vote
OOPSLA
2005
Springer
15 years 7 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
140
click to vote
VLDB
2005
ACM
15 years 7 months ago
2005
ACM
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
144
click to vote
WAOA
2005
Springer
15 years 7 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
108
click to vote
PLDI
2004
ACM
15 years 7 months ago
2004
ACM
When vectorizing for SIMD architectures that are commonly employed by today’s multimedia extensions, one of the new challenges that arise is the handling of memory alignment. Pr...
112
click to vote
SIGMETRICS
2004
ACM
15 years 7 months ago
2004
ACM
Most state-of-the-art commercial storage virtualization systems focus only on one particular storage attribute, capacity. This paper describes the design, implementation and evalu...