Sciweavers

22 search results - page 4 / 5
» Mode-seeking on graphs via random walks
Sort
View
PAKDD
2010
ACM
179views Data Mining» more  PAKDD 2010»
13 years 10 months ago
Answer Diversification for Complex Question Answering on the Web
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
Palakorn Achananuparp, Xiaohua Hu, Tingting He, Ch...
GLOBECOM
2010
IEEE
13 years 3 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun
CC
2008
Springer
133views System Software» more  CC 2008»
13 years 5 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets
TMM
2010
253views Management» more  TMM 2010»
12 years 12 months ago
Multi-View Video Summarization
Previous video summarization studies focused on monocular videos, and the results would not be good if they were applied to multi-view videos directly, due to problems such as the ...
Yanwei Fu, Yanwen Guo, Yanshu Zhu, Feng Liu, Chuan...
SIGIR
2009
ACM
13 years 11 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...