63 search results - page 10 / 13 » Discovering frequent topological structures from graph datas... |
IWCIA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
ICDAR
2009
IEEE
14 years 2 months ago
2009
IEEE
In this research, we propose CAD data mining technique to obtain semantic elements without prior knowledge about plans being designed. Our method consists of two steps. The first ...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
We present a method for unsupervised discovery of abnormal occurrences of activities in multi-dimensional time series data. Unsupervised activity discovery approaches differ from ...
IPPS
1996
IEEE
13 years 11 months ago
1996
IEEE
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...