1433 search results - page 90 / 287 » On Covering Problems of Rado |
143
click to vote
IH
1998
Springer
15 years 10 months ago
1998
Springer
An information-theoretic model for steganography with passive adversaries is proposed. The adversary's task of distinguishing between an innocent cover message C and a modi e...
207
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—Surveillance systems, such as sensor networks and surveillance camera networks, have been widely deployed to monitor events in many different scenarios. One common way to conser...
143
click to vote
AUIC
2006
IEEE
16 years 11 days ago
2006
IEEE
We performed a usability evaluation of four New Zealand university online library catalogues. The evaluation found severe usability problems with online catalogues—we found so m...
177
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
149
click to vote
ASUNAM
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...