945 search results - page 9 / 189 » On the robustness of primitive words |
158
click to vote
BC
2005
15 years 6 months ago
2005
Recent experiments on frogs and rats, have led to the hypothesis that sensory-motor systems are organized into a finite number of linearly combinable modules; each module generates...
157
click to vote
AML
1998
15 years 5 months ago
1998
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
162
click to vote
CACM
2008
15 years 6 months ago
2008
The wireless sensor network community approached netabstractions as an open question, allowing answers to emerge with time and experience. The Trickle algorithm has become a basic...
192
click to vote
AMFG
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract. This paper presents an integrated approach for robustly locating facial landmark for drivers. In the first step a cascade of probability learners is used to detect the f...
142
click to vote
FCT
2009
Springer
16 years 18 days ago
2009
Springer
We study the equivalence problem of deterministic nested word to word transducers and show it to be suprisingly robust. Modulo polynomal time reductions, it can be identified with...