7197 search results - page 302 / 1440 » On the computational power of BlenX |
176
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
192
click to vote
CHES
2008
Springer
15 years 8 months ago
2008
Springer
Modern Graphics Processing Units (GPU) have reached a dimension with respect to performance and gate count exceeding conventional Central Processing Units (CPU) by far. Many modern...
153
click to vote
IFIP
2009
Springer
16 years 1 months ago
2009
Springer
When a computer program requires legitimate access to confidential data, the question arises whether such a program may illegally reveal sensitive information. This paper proposes...
160
click to vote
SYNASC
2005
IEEE
16 years 9 days ago
2005
IEEE
We consider P colonies as introduced in [4] and investigate their computational power when working in the maximally parallel and in the sequential mode. It turns out that there is...
181
click to vote
GLVLSI
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a vector selection methodology for estimating the peak power dissipation in a CMOS logic circuit. The ultimate goal is to combine the speed of RT-level simulation with ...