1414 search results - page 134 / 283 » Randomness and Universal Machines |
88
Voted
JEI
2006
15 years 19 days ago
2006
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...
101
Voted
JSYML
2007
15 years 16 days ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
109
click to vote
COLT
2005
Springer
15 years 6 months ago
2005
Springer
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
93
Voted
CEC
2003
IEEE
15 years 6 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
87
Voted
FLAIRS
2008
15 years 3 months ago
2008
In this paper, we present methods to analyze dialog coherence that help us to automatically distinguish between coherent and incoherent conversations. We build a machine learning ...