Sciweavers

1237 search results - page 20 / 248
» Abstract shade trees
Sort
View
FSTTCS
2005
Springer
15 years 5 months ago
Comparing Trees Via Crossing Minimization
Abstract. Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges...
Henning Fernau, Michael Kaufmann, Mathias Poths
ISAAC
2003
Springer
134views Algorithms» more  ISAAC 2003»
15 years 5 months ago
New Ways to Construct Binary Search Trees
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
Travis Gagie
ISPEC
2010
Springer
15 years 5 months ago
On Fast and Approximate Attack Tree Computations
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
Aivo Jürgenson, Jan Willemson
VISUAL
1999
Springer
15 years 4 months ago
Query Processing and Optimization for Pictorial Query Trees
Abstract. Methods for processing of pictorial queries speci ed by pictorial query trees are presented. Leaves of a pictorial query tree correspond to individual pictorial queries w...
Aya Soffer, Hanan Samet
AIMSA
2000
Springer
15 years 3 months ago
Classification with Belief Decision Trees
Abstract. Decision trees are considered as an efficient technique to express classification knowledge and to use it. However, their most standard algorithms do not deal with uncert...
Zied Elouedi, Khaled Mellouli, Philippe Smets