1518 search results - page 5 / 304 » Exact and Approximate Bandwidth |
DAC
1994
ACM
13 years 10 months ago
1994
ACM
In this paper, we consider the problem of calculating the signal and transition probabilities of the internal nodes of the combinational logic part of a nite state machine (FSM). ...
SIAMSC
2008
13 years 6 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
EGH
2007
Springer
14 years 26 days ago
2007
Springer
In this paper, we first present a survey of existing color buffer compression algorithms. After that, we introduce a new scheme based on an exactly reversible color transform, si...
BMCBI
2006
13 years 6 months ago
2006
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
PODS
1999
ACM
13 years 11 months ago
1999
ACM
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...