Sciweavers

36 search results - page 2 / 8
» Augmenting the discrete timed automaton with other data stru...
Sort
View
120
Voted
ICFEM
2010
Springer
14 years 11 months ago
Making the Right Cut in Model Checking Data-Intensive Timed Systems
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
Rüdiger Ehlers, Michael Gerke 0002, Hans-J&ou...
JCDCG
2004
Springer
15 years 5 months ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 17 days ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
BMCBI
2010
178views more  BMCBI 2010»
15 years 17 days ago
Applications of a formal approach to decipher discrete genetic networks
Background: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant...
Fabien Corblin, Eric Fanchon, Laurent Trilling
100
Voted
KDD
2006
ACM
177views Data Mining» more  KDD 2006»
16 years 26 days ago
Topics over time: a non-Markov continuous-time model of topical trends
This paper presents an LDA-style topic model that captures not only the low-dimensional structure of data, but also how the structure changes over time. Unlike other recent work t...
Xuerui Wang, Andrew McCallum