8431 search results - page 19 / 1687 » Algorithmically Independent Sequences |
ICIP
2001
IEEE
14 years 11 months ago
2001
IEEE
A drawback of most watermarking techniques is the need for some additional information in order to retrieve the watermark. Additionally, the robustness of the watermark decreases ...
ECML
2006
Springer
14 years 1 months ago
2006
Springer
Causal independence modelling is a well-known method both for reducing the size of probability tables and for explaining the underlying mechanisms in Bayesian networks. In this pap...
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
ABSTRACT. We present a simple exact algorithm for the INDEPENDENT SET problem with a run
CORR
2010
Springer
13 years 9 months ago
2010
Springer
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
WEA
2005
Springer
14 years 3 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...