274 search results - page 25 / 55 » Computational complexity of queries based on itemsets |
89
Voted
CHI
2010
ACM
15 years 7 months ago
2010
ACM
Children want to find information about their world, but there are barriers to finding what they seek. Young people have varying abilities to formulate complex queries and compreh...
116
Voted
SSD
2007
Springer
2007
Springer
Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy
15 years 6 months ago
In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...
105
Voted
SAC
2006
ACM
15 years 6 months ago
2006
ACM
Structured data and complex schemas are becoming the main way to represent the information many Digital Libraries provide, thus impacting the services they offer. When searching i...
112
Voted
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
85
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We present an efficient pixel-sampling technique for histogram-based search. Given a template image as a query, a typical histogram-based algorithm aims to find the location of ...