Sciweavers

3223 search results - page 397 / 645
» The Scaling of Search Cost
Sort
View
AAAI
2012
13 years 9 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
WWW
2008
ACM
16 years 7 months ago
Using graphics processors for high-performance IR query processing
Web search engines are facing formidable performance challenges due to data sizes and query loads. The major engines have to process tens of thousands of queries per second over t...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
16 years 6 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
16 years 1 months ago
Using a distance metric to guide PSO algorithms for many-objective optimization
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for manyobjective problems. We use a particle swarm optimization (PSO) a...
Upali K. Wickramasinghe, Xiaodong Li
DASFAA
2010
IEEE
190views Database» more  DASFAA 2010»
15 years 10 months ago
k-Selection Query over Uncertain Data
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang...