Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
EMO
2005
Springer
175views Optimization» more  EMO 2005»
12 years 3 months ago
A New Analysis of the LebMeasure Algorithm for Calculating Hypervolume
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...
R. Lyndon While
IWMM
2007
Springer
122views Hardware» more  IWMM 2007»
12 years 3 months ago
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
Pramod G. Joisha
EMSOFT
2007
Springer
12 years 3 months ago
WCET estimation for executables in the presence of data caches
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...
Rathijit Sen, Y. N. Srikant
COCOON
2007
Springer
12 years 3 months ago
On the Complexity of Finding an Unknown Cut Via Vertex Queries
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, ...
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigi...
ISQED
2007
IEEE
152views Hardware» more  ISQED 2007»
12 years 3 months ago
Variation Aware Timing Based Placement Using Fuzzy Programming
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...
Venkataraman Mahalingam, N. Ranganathan
DSN
2007
IEEE
12 years 4 months ago
Superscalar Processor Performance Enhancement through Reliable Dynamic Clock Frequency Tuning
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...
Viswanathan Subramanian, Mikel Bezdek, Naga Durga ...
ICASSP
2008
IEEE
12 years 4 months ago
Robust multiuser detection based on probability constrained optimization of the MMSE receiver
The performance of multiuser detection (MUD) algorithms for codedivision multiple-access (CDMA) systems depends on the accuracy of channel estimates. Such estimates are typically ...
Sergiy A. Vorobyov
LATA
2009
Springer
12 years 4 months ago
On the Average Size of Glushkov's Automata
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...
Cyril Nicaud
LATIN
2010
Springer
12 years 4 months ago
Layered Working-Set Trees
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...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
ICDE
2007
IEEE
198views Database» more  ICDE 2007»
12 years 11 months ago
Worst-Case Background Knowledge for Privacy-Preserving Data Publishing
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...
David J. Martin, Daniel Kifer, Ashwin Machanavajjh...
books