2252 search results - page 284 / 451 » Lower Bounds for Dynamic Algorithms |
110
Voted
SIGMETRICS
1997
ACM
15 years 7 months ago
1997
ACM
Informed prefetching and caching based on application disclosure of future I/O accesses (hints) can dramatically reduce the execution time of I/O-intensive applications. A recent ...
115
Voted
CP
2009
Springer
15 years 10 months ago
2009
Springer
Multi-objective optimization is concerned with problems involving multiple measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-...
139
Voted
TIP
2008
15 years 3 months ago
2008
Videos representing flames, water, smoke, etc. are often defined as dynamic textures: "textures" because they are characterized by redundant repetition of a pattern and &...
125
Voted
SIGCOMM
2009
ACM
15 years 10 months ago
2009
ACM
Enterprise network security is typically reactive, and it relies heavily on host security and middleboxes. This approach creates complicated interactions between protocols and sys...
148
click to vote
CASES
2003
ACM
15 years 8 months ago
2003
ACM
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...