1451 search results - page 25 / 291 » Finding People by Sampling |
IJCAI
2003
13 years 9 months ago
2003
For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can ...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
A city offers thousands of social events a day, and it is difficult for dwellers to make choices. The combination of mobile phones and recommender systems can change the way one de...
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
ECIR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper we address the problem of searching for knowledgeable persons within the enterprise, known as the expert finding (or expert search) task. We present a proba...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
There has recently been an upsurge of interest in the possibilities of combining structured data and ad-hoc information retrieval from traditional hypertext. In this experiment, w...