Sciweavers

709 search results - page 107 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
WISEC
2010
ACM
14 years 11 months ago
Preventing multi-query attack in location-based services
Despite increasing popularity, Location-based Services (LBS) (e.g., searching nearby points-of-interest on map) on mobile handheld devices have been subject to major privacy conce...
Nilothpal Talukder, Sheikh Iqbal Ahamed
CIKM
2003
Springer
15 years 7 months ago
Operational requirements for scalable search systems
Prior research into search system scalability has primarily addressed query processing efficiency [1, 2, 3] or indexing efficiency [3], or has presented some arbitrary system arch...
Abdur Chowdhury, Greg Pass
USS
2010
14 years 12 months ago
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
Yitao Duan, NetEase Youdao, John Canny, Justin Z. ...
SIGMOD
2007
ACM
151views Database» more  SIGMOD 2007»
16 years 2 months ago
The case for a wide-table approach to manage sparse relational data sets
A "sparse" data set typically has hundreds or even thousands of attributes, but most objects have non-null values for only a small number of these attributes. A popular ...
Eric Chu, Jennifer L. Beckmann, Jeffrey F. Naughto...
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
16 years 2 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...