316 search results - page 32 / 64 » Bounded Depth Data Trees |
EUROCRYPT
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
IJISTA
2008
13 years 9 months ago
2008
Data mining methods can be used for discovering interesting patterns in manufacturing databases. These patterns can be used to improve manufacturing processes. However, data accum...
IGARSS
2010
13 years 7 months ago
2010
We investigate the potential of geospatiotemporal data mining of multi-year land surface phenology data (250 m Normalized Difference Vegetation Index (NDVI) values derived from th...
RT
1999
Springer
14 years 1 months ago
1999
Springer
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...
SODA
1998
ACM
13 years 10 months ago
1998
ACM
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 ...