608 search results - page 58 / 122 » On Dependent Randomized Rounding Algorithms |
CSREASAM
2006
13 years 10 months ago
2006
: The research work in this paper shows that the currently available stenographic methods might be quite easily detected by using sufficiently careful analysis of the transmitted d...
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
ICMCS
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper, we study the security of an image scrambling algorithm based on Space-Filling Curves (SFC). A random SFC is a pixel permutation that changes the scanning order with...
COMPGEOM
2011
ACM
13 years 13 days ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...