Sciweavers

510 search results - page 12 / 102
» How Should We Solve Search Problems Privately
Sort
View
AI
2006
Springer
13 years 7 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
ADHOC
2007
101views more  ADHOC 2007»
13 years 7 months ago
Searching strategies for target discovery in wireless networks
— In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In o...
Zhao Cheng, Wendi B. Heinzelman
ICEB
2004
175views Business» more  ICEB 2004»
13 years 8 months ago
Privacy-Preserving Data Mining in Electronic Surveys
Electronic surveys are an important resource in data mining. However, how to protect respondents' data privacy during the survey is a challenge to the security and privacy co...
Justin Z. Zhan, Stan Matwin
HEURISTICS
2010
13 years 2 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
EUROCRYPT
2001
Springer
13 years 12 months ago
Priced Oblivious Transfer: How to Sell Digital Goods
Abstract. We consider the question of protecting the privacy of customers buying digital goods. More specifically, our goal is to allow a buyer to purchase digital goods from a ve...
William Aiello, Yuval Ishai, Omer Reingold