CORR
2008
Springer
13 years 10 months ago
2008
Springer
CORR
2008
Springer
13 years 10 months ago
2008
Springer
CORR
2008
Springer
13 years 10 months ago
2008
Springer
CORR
2008
Springer
13 years 10 months ago
2008
Springer
The problem of optimum watermark embedding and detection was addressed in a recent paper by Merhav and Sabbag, where the optimality criterion was the maximum false
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alp...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
CORR
2010
Springer
13 years 10 months ago
2010
Springer
In today's world password compromise by some adversaries is common for different purpose. In ICC 2008 Lei et al. proposed a new user authentication system based on the virtual...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
This paper studies two kinds of simulation between cellular automata: simulations based on factor and simulations based on sub-automaton. We show that these two kinds of simulation...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....