Sciweavers

551 search results - page 74 / 111
» Natural proofs
Sort
View
ICIP
2002
IEEE
14 years 10 months ago
On steganalysis of random LSB embedding in continuous-tone images
Abstract? In this paper we present an LSB steganalysis technique that can detect the existence of hidden messages that are randomly embedded in the least significant bits of natura...
Sorina Dumitrescu, Xiaolin Wu, Nasir D. Memon
WWW
2009
ACM
14 years 9 months ago
Rethinking email message and people search
We show how a number of novel email search features can be implemented without any kind of natural language processing (NLP) or advanced data mining. Our approach inspects the ema...
Sebastian Michel, Ingmar Weber
POPL
2004
ACM
14 years 9 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
ICALP
2009
Springer
14 years 9 months ago
Decidability of Conjugacy of Tree-Shifts of Finite Type
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
Nathalie Aubrun, Marie-Pierre Béal
PODS
2004
ACM
137views Database» more  PODS 2004»
14 years 8 months ago
On the Memory Requirements of XPath Evaluation over XML Streams
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski