Sciweavers

1052 search results - page 143 / 211
» The Regular Real-Time Languages
Sort
View
CVPR
2005
IEEE
16 years 5 months ago
Detection and Explanation of Anomalous Activities: Representing Activities as Bags of Event n-Grams
We present a novel representation and method for detecting and explaining anomalous activities in a video stream. Drawing from natural language processing, we introduce a represen...
Raffay Hamid, Amos Y. Johnson, Samir Batta, Aaron ...
111
Voted
ECOOP
2007
Springer
15 years 9 months ago
Metaprogramming with Traits
Abstract. In many domains, classes have highly regular internal structure. For example, so-called business objects often contain boilerplate code for mapping database fields to cl...
John H. Reppy, Aaron Turon
147
Voted
PPSWR
2005
Springer
15 years 9 months ago
Computational Treatment of Temporal Notions: The CTTN-System
The CTTN-system is a computer program which provides advanced processing or temporal notions. The basic data structures of the CTTN-system are time points, crisp and fuzzy time int...
Hans Jürgen Ohlbach
151
Voted
RTA
2005
Springer
15 years 9 months ago
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...
138
Voted
CONCUR
2006
Springer
15 years 5 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson