Sciweavers

1477 search results - page 165 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
CVPR
1998
IEEE
16 years 3 hour ago
Markov Random Fields with Efficient Approximations
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
Yuri Boykov, Olga Veksler, Ramin Zabih
ICML
2005
IEEE
15 years 10 months ago
Harmonic mixtures: combining mixture models and graph-based methods for inductive and scalable semi-supervised learning
Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference f...
Xiaojin Zhu, John D. Lafferty
ECIR
2011
Springer
14 years 1 months ago
A User-Oriented Model for Expert Finding
Expert finding addresses the problem of retrieving a ranked list of people who are knowledgeable on a given topic. Several models have been proposed to solve this task, but so far...
Elena Smirnova, Krisztian Balog
CIKM
2008
Springer
14 years 12 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
14 years 10 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald