Sciweavers

92 search results - page 6 / 19
» Conjunctive Query Evaluation by Search Tree Revisited
Sort
View
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 7 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou
IIS
2003
13 years 8 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
WSDM
2010
ACM
259views Data Mining» more  WSDM 2010»
14 years 4 months ago
Revisiting Globally Sorted Indexes for Efficient Document Retrieval
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
Fan Zhang, Shuming Shi, Hao Yan, Ji-Rong Wen
SIGIR
2012
ACM
11 years 9 months ago
Clarity re-visited
We present a novel interpretation of Clarity [5], a widely used query performance predictor. While Clarity is commonly described as a measure of the “distance” between the lan...
Shay Hummel, Anna Shtok, Fiana Raiber, Oren Kurlan...
CVPR
2000
IEEE
14 years 9 months ago
Nearest Neighbor Search Using Additive Binary Tree
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
Sung-Hyuk Cha, Sargur N. Srihari