807 search results - page 115 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
113
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
123
Voted
ADBIS
1998
Springer
15 years 7 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
130
Voted
EVOW
2008
Springer
15 years 5 months ago
2008
Springer
Adaptation to dynamic optimization problems is currently receiving a growing interest as one of the most important applications of evolutionary algorithms. In this paper, a compoun...
270
Voted
DAWAK
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
147
Voted
CPM
2006
Springer
15 years 7 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...