4926 search results - page 305 / 986 » Two Graph Algorithms On an Associative Computing Model |
165
click to vote
SIGIR
2008
ACM
15 years 5 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 ...
143
click to vote
FOCS
1997
IEEE
15 years 9 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
142
click to vote
CONCUR
2003
Springer
15 years 10 months ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
120
Voted
AAAI
1996
15 years 6 months ago
1996
The paper presents an efficient goal oriented algorithm for symbolic propagation in Bayesian networks. The proposed algorithm performs symbolic propagation using numerical methods...
178
click to vote
SOSP
2009
ACM
16 years 1 months ago
2009
ACM
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...