Sciweavers

1756 search results - page 296 / 352
» Mining Query Logs
Sort
View
COMPGEOM
2003
ACM
14 years 3 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
IEEESP
2010
101views more  IEEESP 2010»
13 years 8 months ago
Preserving Privacy Based on Semantic Policy Tools
Abstract—Private data of individuals is constantly being collected, analyzed, and stored by different kinds of organizations: shopping sites to provide better service and recomme...
Lalana Kagal, Joe Pato
WWW
2011
ACM
13 years 4 months ago
Characterizing search intent diversity into click models
Modeling a user’s click-through behavior in click logs is a challenging task due to the well-known position bias problem. Recent advances in click models have adopted the examin...
Botao Hu, Yuchen Zhang, Weizhu Chen, Gang Wang, Qi...
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 11 months ago
Materialized Sample Views for Database Approximation
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
Shantanu Joshi, Chris Jermaine