Sciweavers

3052 search results - page 15 / 611
» Weakly Distributive Domains
Sort
View
MEDIAFORENSICS
2010
14 years 11 months ago
Modern steganalysis can detect YASS
YASS is a steganographic algorithm for digital images that hides messages robustly in a key-dependent transform domain so that the stego image can be subsequently compressed and d...
Jan Kodovský, Tomás Pevný, Je...
GECCO
2006
Springer
208views Optimization» more  GECCO 2006»
15 years 1 months ago
Comparing evolutionary and temporal difference methods in a reinforcement learning domain
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
COLING
2008
14 years 11 months ago
Weakly Supervised Supertagging with Grammar-Informed Initialization
Much previous work has investigated weak supervision with HMMs and tag dictionaries for part-of-speech tagging, but there have been no similar investigations for the harder proble...
Jason Baldridge
ENTCS
2007
86views more  ENTCS 2007»
14 years 9 months ago
On the Non-sequential Nature of Domain Models of Real-number Computation
Escard´o, Hofmann and Streicher showed that real-number computations in the interval-domain environment are inherently parallel, in the sense that they imply the presence of weak...
Thomas Anberrée
CORR
2010
Springer
137views Education» more  CORR 2010»
14 years 9 months ago
Local algorithms in (weakly) coloured graphs
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...