450 search results - page 1 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
CIAC
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
ICASSP
2010
IEEE
13 years 3 months ago
2010
IEEE
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
SCW
2012
IEEE
12 years 11 days ago
2012
IEEE
ESORICS
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Interest in role-based access control has generated considerable research activity in recent years. A number of interesting problems related to the well known set cover p...
MSS
2008
IEEE
13 years 4 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...