1701 search results - page 29 / 341 » Computer Science and State Machines |
113
click to vote
ACSC
2002
IEEE
15 years 9 months ago
2002
IEEE
We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the m...
150
Voted
DIS
1999
Springer
15 years 8 months ago
1999
Springer
After two decades of research on automated discovery, many principles are shaping up as a foundation of discovery science. In this paper we view discovery science as automation of ...
108
Voted
ICALT
2005
IEEE
15 years 9 months ago
2005
IEEE
The paper proposes a new way of introducing music to 8 to 10 year-old children, by adopting a recent educational tool for teaching Computer Science. Our proposal builds on computa...
137
Voted
CSUR
2011
14 years 7 months ago
2011
178
Voted
LOGCOM
2010
14 years 10 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...