Sciweavers

7404 search results - page 1365 / 1481
» Software performance antipatterns
Sort
View
HPCA
2000
IEEE
15 years 9 months ago
A Prefetching Technique for Irregular Accesses to Linked Data Structures
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
Magnus Karlsson, Fredrik Dahlgren, Per Stenstr&oum...
IEEEPACT
2000
IEEE
15 years 9 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
PLDI
2000
ACM
15 years 9 months ago
Dynamo: a transparent dynamic optimization system
We describe the design and implementation of Dynamo, a software dynamic optimization system that is capable of transparently improving the performance of a native instruction stre...
Vasanth Bala, Evelyn Duesterwald, Sanjeev Banerjia
ICMCS
1999
IEEE
118views Multimedia» more  ICMCS 1999»
15 years 9 months ago
Evaluation of Copyright Marking Systems
Hidden copyright marks have been proposed as a solution for solving the illegal copying and proof of ownership problems in the context of multimedia objects. Many systems have been...
Fabien A. P. Petitcolas, Ross J. Anderson
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 9 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
« Prev « First page 1365 / 1481 Last » Next »