Sciweavers

1901 search results - page 6 / 381
» A probabilistic model based approach for blended search
Sort
View
EVOW
2007
Springer
14 years 1 months ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
IJCAI
2007
13 years 8 months ago
Learning User Clicks in Web Search
Machine learning for predicting user clicks in Webbased search offers automated explanation of user activity. We address click prediction in the Web search scenario by introducing...
Ding Zhou, Levent Bolelli, Jia Li, C. Lee Giles, H...
ICPR
2006
IEEE
14 years 8 months ago
Efficient Search and Verification for Function Based Classification from Real Range Images
In this work we propose a probabilistic model for generic object classification from raw range images. Our approach supports a validation process in which classes are verified usi...
Ehud Rivlin, Ilan Shimshoni, Octavian Soldea
WWW
2006
ACM
14 years 8 months ago
Mining clickthrough data for collaborative web search
This paper is to investigate the group behavior patterns of search activities based on Web search history data, i.e., clickthrough data, to boost search performance. We propose a ...
Jian-Tao Sun, Xuanhui Wang, Dou Shen, Hua-Jun Zeng...
ACL
2008
13 years 8 months ago
A Probabilistic Model for Fine-Grained Expert Search
Expert search, in which given a query a ranked list of experts instead of documents is returned, has been intensively studied recently due to its importance in facilitating the ne...
Shenghua Bao, Huizhong Duan, Qi Zhou, Miao Xiong, ...