Sciweavers

936 search results - page 53 / 188
» FSM-Hume is finite state
Sort
View
COLING
1992
13 years 10 months ago
A Logic Programming View of Relational Morphology
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
Harvey Abramson
ICVGIP
2004
13 years 10 months ago
A Framework for Activity Recognition and Detection of Unusual Activities
In this paper we present a simple framework for activity recognition based on a model of multi-layered finite state machines, built on top of a low level image processing module f...
Dhruv Mahajan, Nipun Kwatra, Sumit Jain, Prem Kalr...
PTS
1993
91views Hardware» more  PTS 1993»
13 years 10 months ago
Generating Tests for Control Portion of SDL Specifications
The signal SAVE construct is one of the features distinguishing SDL from convent specification and programming languages. On the other hand, this feature increase testing SDL-spec...
Gang Luo, Anindya Das, Gregor von Bochmann
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 9 months ago
Pattern Classification In Symbolic Streams via Semantic Annihilation of Information
We propose a technique for pattern classification in symbolic streams via selective erasure of observed symbols, in cases where the patterns of interest are represented as Probabil...
Ishanu Chattopadhyay, Yicheng Wen, Asok Ray
JCT
2006
72views more  JCT 2006»
13 years 8 months ago
Arboricity and tree-packing in locally finite graphs
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
Maya Jakobine Stein