1291 search results - page 37 / 259 » Computing the multiplicity structure in solving polynomial s... |
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
GRC
2007
IEEE
13 years 11 months ago
2007
IEEE
Granular computing is not only a computing model for computer-centered problem solving, but also a thinking model for human-centered problem solving. Some authors have presented t...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract: This paper addresses the problem of equivalence veriļ¬cation of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have diļ¬...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
ECAL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Inspired by the recent advances in evolutionary biology, we have developed a self-organising, self-adaptable cellular system for multitask learning. The main aim of our p...