Sciweavers

1381 search results - page 153 / 277
» Structural signatures for tree data structures
Sort
View
EDBT
2010
ACM
155views Database» more  EDBT 2010»
15 years 1 months ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas
IJPRAI
2002
93views more  IJPRAI 2002»
14 years 9 months ago
Improving Stability of Decision Trees
Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. B...
Mark Last, Oded Maimon, Einat Minkov
CSL
1999
Springer
15 years 2 months ago
Pre-logical Relations
Abstract. We study a weakening of the notion of logical relations, called prelogical relations, that has many of the features that make logical relations so useful but having furth...
Furio Honsell, Donald Sannella
RT
1999
Springer
15 years 2 months ago
Interactive Ray-Traced Scene Editing using Ray Segment Trees
This paper presents a ray tracer that facilitates near-interactive scene editing with incremental rendering; the user can edit the scene both by manipulating objects and by changin...
Kavita Bala, Julie Dorsey, Seth J. Teller
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
14 years 11 months ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal