Sciweavers

285 search results - page 5 / 57
» New Ways to Construct Binary Search Trees
Sort
View
IPL
2002
119views more  IPL 2002»
13 years 8 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
ICDM
2002
IEEE
143views Data Mining» more  ICDM 2002»
14 years 1 months ago
Automatic Web Page Classification in a Dynamic and Hierarchical Way
Automatic classification of web pages is an effective way to deal with the difficulty of retrieving information from the Internet. Although there are many automatic classification...
Xiaogang Peng, Ben Choi
CCCG
2003
13 years 10 months ago
Linear Binary Space Partitions and the Hierarchy of Object Classes
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...
Petr Tobola, Karel Nechvíle
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
13 years 9 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
IJCAI
2007
13 years 10 months ago
Extracting Propositional Rules from Feed-forward Neural Networks - A New Decompositional Approach
In this paper, we present a new decompositional approach for the extraction of propositional rules from feed-forward neural networks of binary threshold units. After decomposing t...
Sebastian Bader, Steffen Hölldobler, Valentin...