28 search results - page 3 / 6 » Approximability of identifying codes and locating-dominating... |
AIRS
2004
Springer
13 years 11 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
MICRO
1998
IEEE
13 years 10 months ago
1998
IEEE
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of condi...
WCRE
2008
IEEE
14 years 13 days ago
2008
IEEE
During software maintenance tasks, developers often spend an important amount of effort investigating source code. This effort can be reduced if tools are available to help develo...
ASPLOS
2009
ACM
14 years 6 months ago
2009
ACM
Miss rate curves (MRCs) are useful in a number of contexts. In our research, online L2 cache MRCs enable us to dynamically identify optimal cache sizes when cache-partitioning a s...
TIT
2010
13 years 23 days ago
2010
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN ch...