3820 search results - page 130 / 764 » Bounded Model Debugging |
105
Voted
ASIACRYPT
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
129
Voted
EUROCRYPT
2003
Springer
15 years 7 months ago
2003
Springer
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
106
Voted
CHI
2010
ACM
15 years 7 months ago
2010
ACM
We introduce a programming environment entitled Share that is designed to encourage loosely bound cooperation between individuals within communities of practice through the sharin...
115
click to vote
ICALP
1992
Springer
15 years 6 months ago
1992
Springer
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
132
Voted
NIPS
2008
15 years 4 months ago
2008
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...