Sciweavers

562 search results - page 15 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
FORMATS
2007
Springer
15 years 1 months ago
Partial Order Reduction for Verification of Real-Time Components
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
John Håkansson, Paul Pettersson
EUSFLAT
2009
233views Fuzzy Logic» more  EUSFLAT 2009»
14 years 7 months ago
SaM: A Split and Merge Algorithm for Fuzzy Frequent Item Set Mining
This paper presents SaM, a split and merge algorithm for frequent item set mining. Its distinguishing qualities are an exceptionally simple algorithm and data structure, which not ...
Christian Borgelt, Xiaomeng Wang
ESOP
2011
Springer
14 years 1 months ago
Measure Transformer Semantics for Bayesian Machine Learning
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
Johannes Borgström, Andrew D. Gordon, Michael...
VISUALIZATION
1992
IEEE
15 years 1 months ago
Display of Scientific Data Structures for Algorithm Visualization
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
15 years 11 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...