Sciweavers

402 search results - page 46 / 81
» Nearest Surrounder Queries
Sort
View
AAAI
2012
11 years 10 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
DEXAW
2009
IEEE
139views Database» more  DEXAW 2009»
14 years 2 months ago
Improving Web Page Retrieval Using Search Context from Clicked Domain Names
Abstract—Search context is a crucial factor that helps to understand a user’s information need in ad-hoc Web page retrieval. A query log of a search engine contains rich inform...
Rongmei Li
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 8 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
EUC
2004
Springer
14 years 1 months ago
Location-Aware Information Retrieval for Mobile Computing
Abstract. With the knowledge about their locations, mobile users are able to issue location-dependent queries. Most of existing approaches focus on how to obtain the information ab...
Jiannong Cao, Kwok Ming Chan, Geoffrey Yu-Kai Shea...
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
14 years 9 months ago
A Generic Framework for Continuous Motion Pattern Query Evaluation
We introduce a novel query type defined over streaming moving object data, namely, the Continuous Motion Pattern (CMP) Queries. A motion pattern is defined as a sequence of distin...
Petko Bakalov, Vassilis J. Tsotras