Sciweavers

1810 search results - page 283 / 362
» BASE: Using Abstraction to Improve Fault Tolerance
Sort
View
IWANN
2005
Springer
15 years 3 months ago
Robust Blind Image Watermarking with Independent Component Analysis: A Embedding Algorithm
Abstract. The authors propose a new solution to the blind robust watermarking of digital images. In this approach we embed the watermark into the independent components of the imag...
Juan José Murillo-Fuentes, Rafael Boloix-To...
PPAM
2005
Springer
15 years 3 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
15 years 3 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
ECAI
2004
Springer
15 years 3 months ago
Planning with Numerical Expressions in LPG
Abstract. We present some techniques for handling planning problems with numerical expressions that can be specified using the standard planning language PDDL. These techniques ar...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
GD
2004
Springer
15 years 3 months ago
Graph Drawing by Stress Majorization
Abstract. One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as ...
Emden R. Gansner, Yehuda Koren, Stephen C. North