Sciweavers

1760 search results - page 105 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
MEDIAFORENSICS
2010
13 years 9 months ago
Minimizing embedding impact in steganography using trellis-coded quantization
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance...
Tomás Filler, Jan Judas, Jessica J. Fridric...
NETWORKS
2007
13 years 7 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
CD
2005
Springer
14 years 1 months ago
Infrastructure for Automatic Dynamic Deployment of J2EE Applications in Distributed Environments
Recent studies showed potential for using component frameworks for building flexible adaptible applications for deployment in distributed environments. However this approach is h...
Anatoly Akkerman, Alexander Totok, Vijay Karamchet...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 12 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
ICALP
2009
Springer
14 years 8 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty