Sciweavers

10493 search results - page 178 / 2099
» Dynamic Word Problems
Sort
View
FUIN
2002
87views more  FUIN 2002»
13 years 8 months ago
On the Injectivity of the Parikh Matrix Mapping
In this paper we investigate the injectivity of the Parikh matrix mapping. This research is done mainly on the binary alphabet. We identify a family of binary words, refered to as...
Adrian Atanasiu, Carlos Martín-Vide, Alexan...
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
14 years 1 months ago
Search Experiment of Business-Rule by Dynamic Constraint Algebra
Abstract Although e-commerce is becoming popular, product rules, which describe various conditions such as prices, applicability, and discount conditions are still expressed in nat...
Rui Kimura, Takayuki Shiga, Mizuho Iwaihara
VTS
2002
IEEE
113views Hardware» more  VTS 2002»
14 years 1 months ago
Testing Static and Dynamic Faults in Random Access Memories
The ever increasing trend to reduce DPM levels of memories requires tests with very high fault coverages. The very important class of dynamic fault, therefore cannot be ignored an...
Said Hamdioui, Zaid Al-Ars, A. J. van de Goor
DAM
2007
79views more  DAM 2007»
13 years 8 months ago
Necessary conditions for multistationarity in discrete dynamical systems
R. Thomas conjectured, twenty years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of severa...
Adrien Richard, Jean-Paul Comet
NLPRS
2001
Springer
14 years 18 days ago
A Simple Closed-Class/Open-Class Factorization for Improved Language Modeling
We describe a simple improvement to ngram language models where we estimate the distribution over closed-class (function) words separately from the conditional distribution of ope...
Fuchun Peng, Dale Schuurmans