1225 search results - page 168 / 245 » Maximal Consistent Subsets |
JOC
2000
13 years 8 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
SIAMCOMP
1998
13 years 8 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
MST
2010
13 years 3 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
TSP
2010
13 years 3 months ago
2010
We consider decentralized multiantenna cognitive radio networks where the secondary (cognitive) users are granted simultaneous spectrum access along with the license-holding (prima...