Sciweavers

1381 search results - page 95 / 277
» Structural signatures for tree data structures
Sort
View
ENTCS
2007
120views more  ENTCS 2007»
14 years 9 months ago
Local Reasoning about Data Update
We present local Hoare reasoning about data update, using Context Logic for analysing structured data. We apply our reasoning to tree update, heap update which is analogous to loc...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 1 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
ICANN
2010
Springer
14 years 11 months ago
Visualising Clusters in Self-Organising Maps with Minimum Spanning Trees
Abstract. The Self-Organising Map (SOM) is a well-known neuralnetwork model that has successfully been used as a data analysis tool in many different domains. The SOM provides a to...
Rudolf Mayer, Andreas Rauber
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
15 years 11 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
15 years 2 months ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...