CORR
2008
Springer
13 years 8 months ago
2008
Springer
11 A classical theorem by Ritt states that all the complete decomposition chains of a univariate polynomial satisfying a certain tameness condition have the same length. In this p...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this note we give a precise formulation of "resistance to arbitrary side information" and show that several relaxations of differential privacy imply it. The formulat...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 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
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 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
2008
Springer
13 years 8 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....
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider two new formulations for classification problems in the spirit of support vector machines based on robust optimization. Our formulations are designed to build in prote...