588 search results - page 50 / 118 » Reducibility and Completeness in Private Computations |
STACS
2007
Springer
14 years 4 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
DSN
2002
IEEE
14 years 3 months ago
2002
IEEE
Reliable multicast delivery requires that a multicast message be received by all members in a group. Hence certain or all members need to buffer messages for possible retransmissi...
ICNP
1998
IEEE
14 years 2 months ago
1998
IEEE
This paper evaluates the congestion control performance of Pseudofed, a congestion-controlled, reliable multicast transport protocol for bulk data transfer. Pseudofed's conge...
ISLPED
1998
ACM
14 years 2 months ago
1998
ACM
CT This paper investigates the low power implementation issues of the soft-output Viterbi algorithm (SOVA), a building block for turbo codes. By briefly explaining the theory of t...
PODC
1997
ACM
14 years 2 months ago
1997
ACM
Wait-free objects are often implemented through the use of a \helping scheme", whereby one process \helps" one or more other processes to complete an operation. This pap...