13603 search results - page 223 / 2721 » On the Complexity of Computing Treelength |
181
click to vote
RT
2004
Springer
15 years 11 months ago
2004
Springer
We introduce a tiled 3D MIP map representation of global illumination data. The representation is an adaptive, sparse octree with a “brick” at each octree node; each brick con...
162
click to vote
ARITH
2003
IEEE
15 years 11 months ago
2003
IEEE
Using the self duality of an optimal normal basis (ONB) of type II, we present a bit parallel systolic multiplier over GF(2m ) which has a low hardware complexity and a low latenc...
145
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
159
Voted
JAIR
2008
15 years 5 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
156
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper describes a novel method for the computation of the Discrete Fourier Transform (DFT). The development of a truly centered DFT is coupled with a method for computing the...