588 search results - page 10 / 118 » Reducibility and Completeness in Private Computations |
ICCD
1991
IEEE
13 years 11 months ago
1991
IEEE
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
COCOON
2005
Springer
13 years 9 months ago
2005
Springer
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The...
ISPAN
1999
IEEE
13 years 11 months ago
1999
IEEE
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approac...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
DCC
2002
IEEE
14 years 7 months ago
2002
IEEE
We point out an interplay between Fq-Frobenius non-classical plane curves and complete (k, d)-arcs in P2 (Fq). A typical example that shows how this works is the one concerning an ...