Sciweavers

1190 search results - page 83 / 238
» On the Structure of Syntenic Distance
Sort
View
ICDE
2006
IEEE
239views Database» more  ICDE 2006»
15 years 4 months ago
Grid Representation for Efficient Similarity Search in Time Series Databases
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
Guifang Duan, Yu Suzuki, Kyoji Kawagoe
SSD
1995
Springer
97views Database» more  SSD 1995»
15 years 1 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet
TABLEAUX
2009
Springer
15 years 4 months ago
Comparative Concept Similarity over Minspaces: Axiomatisation and Tableaux Calculus
We study the logic of comparative concept similarity CSL introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative similarity comparison. In thi...
Régis Alenda, Nicola Olivetti, Camilla Schw...
IJIG
2002
117views more  IJIG 2002»
14 years 9 months ago
Eigenspaces for Graphs
In this paper, we investigate the feasibility of using graph-based descriptions to learn the view structure of 3D objects. The graphs used in our study are constructed from the De...
Bin Luo, Edwin R. Hancock, Richard C. Wilson
COMGEO
1999
ACM
14 years 9 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid