Sciweavers

1278 search results - page 64 / 256
» The Complexity of Weighted Boolean
Sort
View
VIS
2004
IEEE
122views Visualization» more  VIS 2004»
14 years 9 months ago
Light Weight Space Leaping using Ray Coherence
We present a space leaping technique for accelerating volume rendering with very low space and run-time complexity. Our technique exploits the ray coherence during ray casting by ...
Arie E. Kaufman, Sarang Lakare
FMSD
2002
107views more  FMSD 2002»
13 years 7 months ago
Verification of Out-Of-Order Processor Designs Using Model Checking and a Light-Weight Completion Function
We present a new technique for verification of complex hardware devices that allows both generality andahighdegreeofautomation.Thetechniqueisbasedonournewwayofconstructinga"li...
Sergey Berezin, Edmund M. Clarke, Armin Biere, Yun...
ICASSP
2008
IEEE
14 years 2 months ago
Fast perfect weighted resampling
We describe an algorithm for perfect weighted-random sampling of a population with time complexity O(m + n) for sampling m inputs to produce n outputs. This algorithm is an increm...
Bart Massey
FOCS
1998
IEEE
13 years 12 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
13 years 12 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...