103 search results - page 14 / 21 » The Cover Time of Random Digraphs |
CHES
2006
Springer
13 years 11 months ago
2006
Springer
In recent years, some countermeasures against Differential Power Analysis (DPA) at the logic level have been proposed. At CHES 2005 conference, Popp and Mangard proposed a new coun...
HPDC
2008
IEEE
13 years 8 months ago
2008
IEEE
Basic data flow patterns which we call idioms, such as stream, transpose, reduction, random access and stencil, are common in scientific numerical applications. We hypothesize tha...
Book
This is a great draft book about stochastic calculus and finance. It covers large number of topics such as Introduction to Probability Theory, Conditional Expectation, Arbitrage Pr...
DAC
1995
ACM
13 years 11 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
STACS
2004
Springer
14 years 1 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...