EMO
2005
Springer
13 years 9 months ago
2005
Springer
We present a new analysis of the LebMeasure algorithm for calculating hypervolume. We prove that although it is polynomial in the number of points, LebMeasure is exponential in the...
IWMM
2007
Springer
13 years 10 months ago
2007
Springer
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
EMSOFT
2007
Springer
13 years 10 months ago
2007
Springer
This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation...
COCOON
2007
Springer
13 years 10 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
ISQED
2007
IEEE
13 years 10 months ago
2007
IEEE
In nanometer regime, the effects of variations are having an increasing impact on the delay and power characteristics of devices as well as the yield of the circuit. Statistical t...
DSN
2007
IEEE
13 years 10 months ago
2007
IEEE
Synchronous circuits are typically clocked considering worst case timing paths so that timing errors are avoided under all circumstances. In the case of a pipelined processor, thi...
ICASSP
2008
IEEE
13 years 10 months ago
2008
IEEE
The performance of multiuser detection (MUD) algorithms for codedivision multiple-access (CDMA) systems depends on the accuracy of channel estimates. Such estimates are typically ...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Glushkov’s algorithm builds an ε-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of t...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
ICDE
2007
IEEE
14 years 5 months ago
2007
IEEE
Recent work has shown the necessity of considering an attacker's background knowledge when reasoning about privacy in data publishing. However, in practice, the data publishe...