778 search results - page 27 / 156 » Modelling a Query Space Using Associations |
118
click to vote
WWW
2010
ACM
15 years 8 months ago
2010
ACM
Click data captures many users’ document preferences for a query and has been shown to help significantly improve search engine ranking. However, most click data is noisy and of...
124
click to vote
SPIRE
2001
Springer
15 years 6 months ago
2001
Springer
In this paper, we study query processing in a distributed text database. The novelty is a real distributed architecture implementation that offers concurrent query service. The di...
219
click to vote
VLDB
2008
ACM
16 years 2 months ago
2008
ACM
With the development of inexpensive storage devices, space usage is no longer a bottleneck for computer users. However, the increasingly large amount of personal information poses ...
126
Voted
APN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper, we define Time Petri Nets with Inhibitor Hyperarcs (IHTPN) as an extension of T-time Petri nets where time is associated with transitions. In this model, ...
98
Voted
ADC
1999
Springer
15 years 6 months ago
1999
Springer
We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity ...