Sciweavers

7064 search results - page 344 / 1413
» From States to Histories
Sort
View
IANDC
2010
116views more  IANDC 2010»
15 years 5 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
EMNLP
2010
15 years 4 months ago
Automatically Producing Plot Unit Representations for Narrative Text
In the 1980s, plot units were proposed as a conceptual knowledge structure for representing and summarizing narrative stories. Our research explores whether current NLP technology...
Amit Goyal, Ellen Riloff, Hal Daumé III
SIMULATION
2011
15 years 1 months ago
The Activity-tracking paradigm in discrete-event modeling and simulation: The case of spatially continuous distributed systems
From a modelling and simulation perspective, studying dynamic systems consists of focusing on changes in states. According to the precision of state changes, generic algorithms ca...
Alexandre Muzy, Rajanikanth Jammalamadaka, Bernard...
IACR
2011
91views more  IACR 2011»
14 years 6 months ago
A Scalable Method for Constructing Galois NLFSRs with Period $2^n-1$ using Cross-Join Pairs
This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a ...
Elena Dubrova
INFOCOM
2011
IEEE
14 years 10 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna