Abstract. An overview of the concept of program similarity is presented. It divides similarity into two types--syntactic and semantic-and provides a review of eight categories of m...
Andrew Walenstein, Mohammad El-Ramly, James R. Cor...
This paper explores similarity criteria between non-rigid shapes. Broadly speaking, such criteria are divided into intrinsic and extrinsic, the first referring to the metric struc...
Alexander M. Bronstein, Michael M. Bronstein, Ron ...
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity ...
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...