Sciweavers

50 search results - page 9 / 10
» Enhancing Graph Database Indexing by Suffix Tree Structure
Sort
View
ICPR
2008
IEEE
15 years 4 months ago
Retinal vessel tree segmentation using a deformable contour model
This paper presents an improved version of our specific methodology to detect the vessel tree in retinal angiographies. The automatic analysis of retinal vessel tree facilitates ...
Lucia Espona, María J. Carreira, Manuel Fra...
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
15 years 3 months ago
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
Tomás Skopal, David Hoksza
ICDE
2009
IEEE
205views Database» more  ICDE 2009»
15 years 11 months ago
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
Thanh Tran, Haofen Wang, Sebastian Rudolph, Philip...
99
Voted
VLDB
2002
ACM
108views Database» more  VLDB 2002»
14 years 9 months ago
Energy-performance trade-offs for spatial access methods on memory-resident data
Abstract. The proliferation of mobile and pervasive computing devices has brought energy constraints into the limelight. Energy-conscious design is important at all levels of syste...
Ning An, Sudhanva Gurumurthi, Anand Sivasubramania...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
15 years 9 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu