Sciweavers

2610 search results - page 295 / 522
» The Recognition Strategy Language
Sort
View
STACS
2005
Springer
16 years 10 hour ago
Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
Victor Poupet
ISMIR
2004
Springer
105views Music» more  ISMIR 2004»
15 years 12 months ago
Pregroup Grammars for Chords
Pregroups had been conceived as an algebraic tool to recognize grammatically well-formed sentences in natural languages [3]. Here we wish to use pregroups to recognize well-formed...
Richard Terrat
COMPCON
1994
IEEE
15 years 10 months ago
The Newton Application Architecture
The application architecture of Newton, a technology for supporting Personal Digital Assistants (PDAs), is described. It combines a dynamic, object-oriented language called Newton...
Walter R. Smith
AMFG
2007
IEEE
255views Biometrics» more  AMFG 2007»
15 years 10 months ago
A New Probabilistic Model for Recognizing Signs with Systematic Modulations
Abstract. This paper addresses an aspect of sign language (SL) recognition that has largely been overlooked in previous work and yet is integral to signed communication. It is the ...
Sylvie C. W. Ong, Surendra Ranganath
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 8 months ago
A Particular Universal Cellular Automaton
Abstract. Signals are a classical tool of cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collision...
Nicolas Ollinger, Gaétan Richard