4451 search results - page 282 / 891 » On Random Ordering Constraints |
158
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
165
click to vote
CISS
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract—This paper presents a novel zero-sum watermarking game between a detection algorithm and a data hiding adversary. Contrary to previous research, the detection algorithm ...
167
click to vote
OPODIS
2007
15 years 8 months ago
2007
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
162
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
Abstract-- This paper considers uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set which is a set of initial states prob...
154
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...