2152 search results - page 296 / 431 » A Comparative Study of 2QBF Algorithms |
157
click to vote
SIGIR
2004
ACM
15 years 10 months ago
2004
ACM
In this paper we study the problem of finding most topical named entities among all entities in a document, which we refer to as focused named entity recognition. We show that th...
167
click to vote
SC
2003
ACM
15 years 10 months ago
2003
ACM
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...
163
Voted
WEBDB
2010
Springer
15 years 10 months ago
2010
Springer
The transition of search engine users’ intents has been studied for a long time. The knowledge of intent transition, once discovered, can yield a better understanding of how di...
145
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
115
click to vote
ICML
2003
IEEE
16 years 5 months ago
2003
IEEE
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...