Sciweavers

2042 search results - page 204 / 409
» Variable Number of
Sort
View
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
16 years 5 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
126
Voted
DCC
2008
IEEE
16 years 4 months ago
High-Resolution Functional Quantization
Suppose a function of N real source variables XN 1 = (X1, X2, . . . , XN ) is desired at a destination constrained to receive a limited number of bits. If the result of evaluating...
Vinith Misra, Vivek K. Goyal, Lav R. Varshney
ISQED
2010
IEEE
194views Hardware» more  ISQED 2010»
15 years 12 months ago
Accelerating trace computation in post-silicon debug
— Post-silicon debug comprises a significant and highly variable fraction of the total development time for large chip designs. To accelerate post-silicon debug, BackSpace [1, 2...
Johnny J. W. Kuan, Steven J. E. Wilton, Tor M. Aam...
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
15 years 11 months ago
Exploiting structure in an AIG based QBF solver
—In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure. We make extensive use of s...
Florian Pigorsch, Christoph Scholl
ICASSP
2009
IEEE
15 years 11 months ago
Modal expansion of HRTFs: Continuous representation in frequency-range-angle
This paper proposes a continuous HRTF representation in both 3D spatial and frequency domains. The method is based on the acoustic reciprocity principle and a modal expansion of t...
Wen Zhang, Thushara D. Abhayapala, Rodney A. Kenne...