Sciweavers

441 search results - page 29 / 89
» Query expansion using random walk models
Sort
View
SAC
2010
ACM
14 years 4 months ago
Spanders: distributed spanning expanders
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
Shlomi Dolev, Nir Tzachar
CVPR
2010
IEEE
14 years 6 months ago
Segmentation of Building Facades Using Procedural Shape Priors
In this paper we propose a novel approach to the perceptual interpretation of building facades that combines shape grammars, supervised classification and random walks. Procedural...
Olivier Teboul, Loic Simon, Panagiotis Koutsouraki...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 11 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
SIGIR
2003
ACM
14 years 3 months ago
Exploiting query history for document ranking in interactive information retrieval
In this poster,we incorporate user query history, as context information, to improve the retrieval performance in interactive retrieval. Experiments using the TREC data show that ...
Xuehua Shen, ChengXiang Zhai
SIGIR
2009
ACM
14 years 4 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...