19866 search results - page 209 / 3974 » Computing all factorizations in *** |
154
click to vote
COCOON
2005
Springer
16 years 3 days ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
165
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...
161
click to vote
ARCS
2006
Springer
15 years 10 months ago
2006
Springer
: We investigate image steganography under re-encoding of images. After a secret message or a digital watermark is embedded into a jpeg image, quite frequently the image is re-enco...
147
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper is the first extensive performance study of a recently proposed parallel programming model, called Concurrent Collections (CnC). In CnC, the programmer expresses her co...
232
click to vote
PC
2012
14 years 2 months ago
2012
— The frenetic development of the current architectures places a strain on the current state-of-the-art programming environments. Harnessing the full potential of such architectu...