1756 search results - page 148 / 352 » Mining Query Logs |
125
Voted
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
112
click to vote
CLEF
2010
Springer
15 years 1 months ago
2010
Springer
In our participation to the 2010 LogCLEF track we focused on the analysis of the European Library (TEL) logs and in particular we experimented with the identification of the natura...
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
119
Voted
DAWAK
2003
Springer
15 years 6 months ago
2003
Springer
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
CN
2000
15 years 19 days ago
2000
The Web contains an abundance of useful semi-structured information that can and should be mined. Types of structure include hyperlinks between pages, structure within hypertext p...