Sciweavers

404 search results - page 17 / 81
» Correlation search in graph databases
Sort
View
CIKM
2010
Springer
13 years 7 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
ICPR
2002
IEEE
14 years 9 months ago
Metric-Based Shape Retrieval in Large Databases
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
Thomas B. Sebastian, Benjamin B. Kimia
ADC
2004
Springer
105views Database» more  ADC 2004»
14 years 2 months ago
Do Clarity Scores for Queries Correlate with User Performance?
Recently the concept of a clarity score was introduced in order to measure the ambiguity of a query in relation to the collection in which the query issuer is seeking information ...
Andrew Turpin, William R. Hersh
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
14 years 8 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
ICCV
2009
IEEE
13 years 6 months ago
Image annotation using multi-label correlated Green's function
Image annotation has been an active research topic in the recent years due to its potentially large impact on both image understanding and web/database image search. In this paper...
Hua Wang, Heng Huang, Chris H. Q. Ding