3038 search results - page 234 / 608 » High-Speed Function Approximation |
205
Voted
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
184
click to vote
ICCD
2002
IEEE
16 years 3 months ago
2002
IEEE
We represent switching activity in VLSI circuits using a graphical probabilistic model based on Cascaded Bayesian Networks (CBN’s). We develop an elegant method for maintaining ...
184
click to vote
EUROCRYPT
2005
Springer
16 years 5 days ago
2005
Springer
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
173
click to vote
FCT
2005
Springer
16 years 5 days ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
187
click to vote
AMC
2006
15 years 6 months ago
2006
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and t...