Sciweavers

739 search results - page 99 / 148
» Evaluation of Query Generators for Entity Search Engines
Sort
View
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
15 years 11 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
ICTIR
2009
Springer
15 years 1 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette
CIKM
2010
Springer
15 years 2 months ago
Online learning for recency search ranking using real-time user feedback
Traditional machine-learned ranking algorithms for web search are trained in batch mode, which assume static relevance of documents for a given query. Although such a batch-learni...
Taesup Moon, Lihong Li, Wei Chu, Ciya Liao, Zhaohu...
CIKM
2005
Springer
15 years 9 months ago
Generating better concept hierarchies using automatic document classification
This paper presents a hybrid concept hierarchy development technique for web returned documents retrieved by a meta-search engine. The aim of the technique is to separate the init...
Razvan Stefan Bot, Yi-fang Brook Wu, Xin Chen, Qua...
SIGMOD
2011
ACM
290views Database» more  SIGMOD 2011»
14 years 6 months ago
Database state generation via dynamic symbolic execution for coverage criteria
Automatically generating sufficient database states is imperative to reduce human efforts in testing database applications. Complementing the traditional block or branch coverage...
Kai Pan, Xintao Wu, Tao Xie