Sciweavers

903 search results - page 6 / 181
» Non-well-founded trees in categories
Sort
View
ENTCS
2006
150views more  ENTCS 2006»
14 years 11 months ago
Causality Versus True-Concurrency
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Sibylle B. Fröschle, Slawomir Lasota
CIKM
2008
Springer
15 years 1 months ago
Efficient frequent pattern mining over data streams
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
CISSE
2008
Springer
15 years 1 months ago
Improved Induction Tree Training for Automatic Lexical Categorization
This paper studies a tuned version of an induction tree which is used for automatic detection of lexical word category. The database used to train the tree has several fields to de...
M. D. López De Luise, M. Soffer, F. Spelanz...
CCS
2007
ACM
15 years 5 months ago
Defining categories to select representative attack test-cases
To ameliorate the quality of protection provided by intrusion detection systems (IDS) we strongly need more effective evaluation and testing procedures. Evaluating an IDS against ...
Mohammed S. Gadelrab, Anas Abou El Kalam, Yves Des...
ICDM
2002
IEEE
122views Data Mining» more  ICDM 2002»
15 years 4 months ago
Using Category-Based Adherence to Cluster Market-Basket Data
In this paper, we devise an efficient algorithm for clustering market-basket data. Different from those of the traditional data, the features of market-basket data are known to b...
Ching-Huang Yun, Kun-Ta Chuang, Ming-Syan Chen