Sciweavers

1889 search results - page 100 / 378
» Re-ranking search results using query logs
Sort
View
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 5 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
KDD
2007
ACM
169views Data Mining» more  KDD 2007»
14 years 10 months ago
Exploiting underrepresented query aspects for automatic query expansion
Users attempt to express their search goals through web search queries. When a search goal has multiple components or aspects, documents that represent all the aspects are likely ...
Daniel Crabtree, Peter Andreae, Xiaoying Gao
IJRR
2008
107views more  IJRR 2008»
13 years 10 months ago
Caging Polygons with Two and Three Fingers
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
Mostafa Vahedi, A. Frank van der Stappen
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
14 years 2 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
WWW
2011
ACM
13 years 5 months ago
Ranking in context-aware recommender systems
As context is acknowledged as an important factor that can affect users’ preferences, many researchers have worked on improving the quality of recommender systems by utilizing ...
Minsuk Kahng, Sangkeun Lee, Sang-goo Lee