250 search results - page 36 / 50 » A Practical Approach to Morse-Smale Complex Computation: Sca... |
NIPS
2007
13 years 9 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
ICCD
2005
IEEE
14 years 4 months ago
2005
IEEE
The advent of nanometer feature sizes in silicon fabrication has triggered a number of new design challenges for computer designers. These challenges include design complexity and...
ESAS
2004
Springer
14 years 28 days ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
DSOM
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. Enterprise applications implement business resource management systems, customer relationship management systems, and general systems for commerce. These applications rel...
FC
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. For the homomorphic Paillier cryptosystem we construct a protocol for secure modulo reduction, that on input of an encryption x with x of bit length x and a public ‘mod...