Sciweavers

462 search results - page 66 / 93
» Symbolic Bounded Synthesis
Sort
View
112
Voted
VLDB
2007
ACM
141views Database» more  VLDB 2007»
15 years 8 months ago
UQLIPS: A Real-time Near-duplicate Video Clip Detection System
Near-duplicate video clip (NDVC) detection is an important problem with a wide range of applications such as TV broadcast monitoring, video copyright enforcement, content-based vi...
Heng Tao Shen, Xiaofang Zhou, Zi Huang, Jie Shao, ...
118
Voted
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
15 years 7 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
15 years 7 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
135
Voted
COCOON
2005
Springer
15 years 7 months ago
On Sequential and 1-Deterministic P Systems
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe...
105
Voted
BIRTHDAY
1992
Springer
15 years 6 months ago
Single Tree Grammars
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
Sheila A. Greibach, Weiping Shi, Shai Simonson