Sciweavers

8724 search results - page 52 / 1745
» Search result diversification
Sort
View
WWW
2008
ACM
15 years 10 months ago
Static query result caching revisited
Query result caching is an important mechanism for search engine efficiency. In this study, we first review several query features that are used to determine the contents of a sta...
Özgür Ulusoy, Ismail Sengör Alting&...
IPL
2002
119views more  IPL 2002»
14 years 9 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
WWW
2005
ACM
15 years 10 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
DEBU
2010
104views more  DEBU 2010»
14 years 9 months ago
Query Results Ready, Now What?
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...
Ziyang Liu, Yi Chen
PAMI
2007
156views more  PAMI 2007»
14 years 9 months ago
Selection and Fusion of Color Models for Image Feature Detection
—The choice of a color model is of great importance for many computer vision algorithms (e.g., feature detection, object recognition, and tracking) as the chosen color model indu...
Harro M. G. Stokman, Theo Gevers