Sciweavers

3946 search results - page 465 / 790
» The computational complexity of choice sets
Sort
View
JEI
2006
128views more  JEI 2006»
15 years 6 months ago
Performance study of common image steganography and steganalysis techniques
Abstract. We investigate the performance of state of the art universal steganalyzers proposed in the literature. These universal steganalyzers are tested against a number of well-k...
Mehdi Kharrazi, Husrev T. Sencar, Nasir D. Memon
LOGCOM
2006
90views more  LOGCOM 2006»
15 years 6 months ago
ATL Satisfiability is Indeed EXPTIME-complete
The Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems ...
Dirk Walther, Carsten Lutz, Frank Wolter, Michael ...
LOGCOM
2007
115views more  LOGCOM 2007»
15 years 6 months ago
The Dynamics of Syntactic Knowledge
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
Thomas Ågotnes, Natasha Alechina
CGF
1998
134views more  CGF 1998»
15 years 6 months ago
Progressive Iso-Surface Extraction from Hierarchical 3D Meshes
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dime...
Wenli Cai, Georgios Sakas, Roberto Grosso, Thomas ...
IJCV
2002
157views more  IJCV 2002»
15 years 6 months ago
Dense Features for Semi-Dense Stereo Correspondence
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler