1284 search results - page 50 / 257 » Data Structures for Mergeable Trees |
ISVC
2007
Springer
14 years 1 months ago
2007
Springer
Many computer graphics rendering algorithms and techniques use ray tracing for generation of natural and photo-realistic images. The efficiency of the ray tracing algorithms depend...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
ACSC
2002
IEEE
14 years 14 days ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
ECML
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
MMM
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...