668 search results - page 77 / 134 » Algorithmics and Applications of Tree and Graph Searching |
135
Voted
SIGIR
2008
ACM
15 years 2 months ago
2008
ACM
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
112
click to vote
IJFCS
1998
15 years 2 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
140
click to vote
ISCC
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
119
Voted
SIGMETRICS
2002
ACM
15 years 2 months ago
2002
ACM
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
139
Voted
SISAP
2009
IEEE
15 years 9 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...