1284 search results - page 54 / 257 » Data Structures for Mergeable Trees |
KDD
2002
ACM
14 years 8 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
AGIS
1998
13 years 7 months ago
1998
With the development of modern cities, 3-D spatial information systems (SIS) are increasingly required for spatial planning, communication systems and other applications. The geom...
TLDI
2005
ACM
14 years 1 months ago
2005
ACM
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
ICDM
2003
IEEE
14 years 25 days ago
2003
IEEE
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...
MICS
2010
13 years 6 months ago
2010
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...