588 search results - page 50 / 118 » Reducibility and Completeness in Private Computations |
143
click to vote
STACS
2007
Springer
16 years 7 days 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...
139
click to vote
DSN
2002
IEEE
15 years 11 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...
183
click to vote
ICNP
1998
IEEE
15 years 10 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...
172
click to vote
ISLPED
1998
ACM
15 years 10 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...
152
click to vote
PODC
1997
ACM
15 years 10 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...