2152 search results - page 400 / 431 » A Comparative Study of 2QBF Algorithms |
144
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
124
click to vote
MOBIHOC
2009
ACM
16 years 4 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
157
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Abstract. Most existing search engines employ static ranking algorithms that do not adapt to the specific needs of users. Recently, some researchers have studied the use of clickth...
145
click to vote
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
133
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...