Sciweavers

4744 search results - page 249 / 949
» Connected Computing
Sort
View
TIFS
2010
120views more  TIFS 2010»
14 years 10 months ago
Gibbs Construction in Steganography
Abstract--We make a connection between steganography design by minimizing embedding distortion and statistical physics. The unique aspect of this work and one that distinguishes it...
Tomás Filler, Jessica J. Fridrich
ICASSP
2011
IEEE
14 years 7 months ago
Guaranteed error correction based on Fourier Compressive Sensing and Projective Geometry
The sparse error correction is intimately related to Compressive Sensing. Exploiting this connection, the paper proposes an error correction scheme pivoted on partial Fourier matr...
B. S. Adiga, M. Girish Chandra, Shreeniwas Sapre
CG
2010
Springer
15 years 1 months ago
Score Bounded Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
Tristan Cazenave, Abdallah Saffidine
IPSN
2010
Springer
15 years 10 months ago
Multichannel reliability assessment in real world WSNs
We study the utility of dynamic frequency agility in realworld wireless sensor networks. Many view such agility as essential to obtaining adequate reliability in industrial enviro...
Jorge Ortiz, David E. Culler
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
15 years 10 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma