Sciweavers

39 search results - page 6 / 8
» Nullness Analysis in Boolean Form
Sort
View
DAM
1999
100views more  DAM 1999»
13 years 6 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
FOCS
2010
IEEE
13 years 5 months ago
A Fourier-Analytic Approach to Reed-Muller Decoding
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
Parikshit Gopalan
BMVC
2010
13 years 5 months ago
Background Modelling on Tensor Field for Foreground Segmentation
The paper proposes a new method to perform foreground detection by means of background modeling using the tensor concept. Sometimes, statistical modelling directly on image values...
Rui Caseiro, Jorge Batista, Pedro Martins
VISUALIZATION
2005
IEEE
14 years 18 days ago
Query-Driven Visualization of Large Data Sets
We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is cons...
Kurt Stockinger, John Shalf, Kesheng Wu, E. Wes Be...
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
14 years 1 months ago
Overcoming glitches and dissipation timing skews in design of DPA-resistant cryptographic hardware
Cryptographic embedded systems are vulnerable to Differential Power Analysis (DPA) attacks. In this paper, we propose a logic design style, called as Precharge Masked Reed-Muller ...
Kuan Jen Lin, Shan Chien Fang, Shih Hsien Yang, Ch...