Sciweavers

1381 search results - page 61 / 277
» Structural signatures for tree data structures
Sort
View
LFCS
2007
Springer
15 years 3 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
15 years 11 months ago
Unordered Tree Mining with Applications to Phylogeny
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
Dennis Shasha, Jason Tsong-Li Wang, Sen Zhang
UAI
2000
14 years 11 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
SAFECOMP
1998
Springer
15 years 1 months ago
Safety Verification of Software Using Structured Petri Nets
A method is described for the analysis and the verification of safety in software systems. The method offers a formal notation for describing the software structure, the means for ...
Krzysztof Sacha
ISCI
2006
96views more  ISCI 2006»
14 years 9 months ago
A comparison of classification accuracy of four genetic programming-evolved intelligent structures
We investigate the effectiveness of GP-generated intelligent structures in classification tasks. Specifically, we present and use four context-free grammars to describe (1) decisi...
Athanasios Tsakonas