Sciweavers

1529 search results - page 116 / 306
» On Timing Analysis of Combinational Circuits
Sort
View
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
13 years 9 months ago
An Experimental Analysis of a Compact Graph Representation
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
DAC
2001
ACM
14 years 9 months ago
Circuit-based Boolean Reasoning
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
Andreas Kuehlmann, Malay K. Ganai, Viresh Paruthi
ASIACRYPT
2010
Springer
13 years 6 months ago
Faster Fully Homomorphic Encryption
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
Damien Stehlé, Ron Steinfeld
WCET
2008
13 years 9 months ago
INFER: Interactive Timing Profiles based on Bayesian Networks
We propose an approach for timing analysis of software-based embedded computer systems that builds on the established probabilistic framework of Bayesian networks. We envision an ...
Michael Zolda
ICAD
2004
13 years 9 months ago
Polyrhythm in the Human Brain
Three complementary methods are used to analyze the dynamics of multivariate EEG data obtained from a human listening to a piece of music. The analysis yields parameters for a dat...
Thomas Hermann, Gerold Baier, Markus Müller