Sciweavers

249 search results - page 18 / 50
» Metric space similarity joins
Sort
View
DAGSTUHL
2006
13 years 9 months ago
Similarity in Programs
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...
ICCV
2007
IEEE
14 years 9 months ago
Rock, Paper, and Scissors: extrinsic vs. intrinsic similarity of non-rigid shapes
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 ...
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
14 years 7 months ago
Estimating Compilation Time of a Query Optimizer
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...
ADC
1999
Springer
68views Database» more  ADC 1999»
13 years 12 months ago
A Query-sensitive Cost Model for Similarity Queries with M-tree
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 ...
Paolo Ciaccia, A. Nanni, Marco Patella
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 7 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
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...
Rina Panigrahy, Kunal Talwar, Udi Wieder