536 search results - page 25 / 108 » The hardness and approximation algorithms for l-diversity |
ICC
2009
IEEE
2009
IEEE
Iterative Detection and Decoding for Hard-Decision Forwarding Aided Cooperative Spatial Multiplexing
14 years 2 months ago
— In this paper, 1 the optimal decoding strategy for cooperative spatial multiplexing (CSM) aided systems is derived. In CSM systems, the multiple relay stations (RSs), which com...
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
PPAM
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...