Sciweavers

727 search results - page 13 / 146
» Private approximation of search problems
Sort
View
AUSAI
2004
Springer
14 years 3 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
ICRA
2008
IEEE
125views Robotics» more  ICRA 2008»
14 years 4 months ago
An approximation algorithm for the least overlapping p-Frame problem with non-partial coverage for networked robotic cameras
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
Yiliang Xu, Dezhen Song, Jingang Yi, A. Frank van ...
WWW
2007
ACM
14 years 10 months ago
Cantina: a content-based approach to detecting phishing web sites
Phishing is a significant problem involving fraudulent email and web sites that trick unsuspecting users into revealing private information. In this paper, we present the design, ...
Jason I. Hong, Lorrie Faith Cranor, Yue Zhang 0002
PET
2012
Springer
12 years 7 days ago
PRISM - Privacy-Preserving Search in MapReduce
We present PRISM, a privacy-preserving scheme for word search in cloud computing. In the face of a curious cloud provider, the main challenge is to design a scheme that achieves pr...
Erik-Oliver Blass, Roberto Di Pietro, Refik Molva,...
FOCS
2004
IEEE
14 years 1 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev