Sciweavers

10493 search results - page 19 / 2099
» Dynamic Word Problems
Sort
View
AUTOMATICA
2006
91views more  AUTOMATICA 2006»
13 years 7 months ago
Necessary and sufficient conditions for reachability on a simplex
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
Bartek Roszak, Mireille E. Broucke
COGSCI
2004
90views more  COGSCI 2004»
13 years 7 months ago
Moving words: dynamic representations in language comprehension
Eighty-two participants listened to sentences and then judged whether two sequentially presented visual objects were the same. On critical trials, participants heard a sentence de...
Rolf A. Zwaan, Carol J. Madden, Richard H. Yaxley,...
DATE
1998
IEEE
70views Hardware» more  DATE 1998»
13 years 12 months ago
Dynamic Minimization of Word-Level Decision Diagrams
Stefan Höreth, Rolf Drechsler
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
Traced communication complexity of cellular automata
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...
Eric Goles Ch., Pierre Guillon, Ivan Rapaport
IJCNLP
2005
Springer
14 years 1 months ago
A Chunking Strategy Towards Unknown Word Detection in Chinese Word Segmentation
This paper proposes a chunking strategy to detect unknown words in Chinese word segmentation. First, a raw sentence is pre-segmented into a sequence of word atoms 1 using a maximum...
Guodong Zhou