4075 search results - page 781 / 815 » Modeling Distributed Algorithm Using B |
121
click to vote
SIGIR
2008
ACM
15 years 12 days 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 ...
128
click to vote
KDD
2008
ACM
16 years 27 days ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
109
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
112
Voted
SIGGRAPH
1999
ACM
15 years 4 months ago
1999
ACM
In this paper we present a technique for computing the direct lighting in a three-dimensional scene containing area light sources. Our method correctly handles partial visibility ...
94
Voted
SIGGRAPH
1993
ACM
15 years 4 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...