79 search results - page 4 / 16 » Applications of Quick-Combine for Ranked Query Models |
WWW
2004
ACM
14 years 9 months ago
2004
ACM
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
CIKM
2004
Springer
14 years 1 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
CIKM
2011
Springer
12 years 8 months ago
2011
Springer
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
CIKM
2011
Springer
12 years 8 months ago
2011
Springer
Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...