Sciweavers

1756 search results - page 142 / 352
» Mining Query Logs
Sort
View
123
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
120
Voted
AI
2010
Springer
15 years 2 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
129
Voted
KDD
2006
ACM
185views Data Mining» more  KDD 2006»
16 years 3 months ago
How to Define Searching Sessions on Web Search Engines
We investigate three methods for defining a session on Web search engines. We examine 2,465,145 interactions from 534,507 Web searchers. We compare defining sessions using: 1) Int...
Bernard J. Jansen, Amanda Spink, Vinish Kathuria
127
Voted
WWW
2009
ACM
16 years 3 months ago
Search result re-ranking based on gap between search queries and social tags
Both search engine click-through log and social annotation have been utilized as user feedback for search result re-ranking. However, to our best knowledge, no previous study has ...
Jun Yan, Ning Liu, Elaine Qing Chang, Lei Ji, Zhen...
180
Voted
SIGIR
2011
ACM
14 years 5 months ago
Learning search tasks in queries and web pages via graph regularization
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...
Ming Ji, Jun Yan, Siyu Gu, Jiawei Han, Xiaofei He,...