117 search results - page 12 / 24 » Query suggestion using hitting time |
CIKM
2008
Springer
13 years 8 months ago
2008
Springer
We propose a framework for searching the Wikipedia with contextual information. Our framework extends the typical keyword search, by considering queries of the type q, p , where q...
EUROCOLT
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
FUN
2010
Springer
13 years 10 months ago
2010
Springer
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
VLDB
2005
ACM
14 years 6 days ago
2005
ACM
We present DITN, a new method of parallel querying based on dynamic outsourcing of join processing tasks to non-dedicated, heterogeneous computers. In DITN, partitioning is not th...
ICDE
1999
IEEE
14 years 8 months ago
1999
IEEE
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...