1983 search results - page 71 / 397 » Competitive graph searches |
114
click to vote
ICPR
2002
IEEE
16 years 3 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
126
Voted
WWW
2008
ACM
16 years 3 months ago
2008
ACM
A bipartite query-URL graph, where an edge indicates that a document was clicked for a query, is a useful construct for finding groups of related queries and URLs. Here we use thi...
113
Voted
GD
2005
Springer
15 years 8 months ago
2005
Springer
TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific no...
145
Voted
WWW
2009
ACM
15 years 9 months ago
2009
ACM
This paper proposes an effective approach to provide relevant search terms for conceptual Web search. ‘Semantic Term Suggestion’ function has been included so that users can f...
116
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...