Sciweavers

321 search results - page 43 / 65
» Secure Multiparty Computation of Approximations
Sort
View
PAKDD
2007
ACM
140views Data Mining» more  PAKDD 2007»
14 years 4 months ago
A Hybrid Multi-group Privacy-Preserving Approach for Building Decision Trees
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...
Zhouxuan Teng, Wenliang Du
ICDM
2006
IEEE
139views Data Mining» more  ICDM 2006»
14 years 4 months ago
Privacy Preserving Nearest Neighbor Search
Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privac...
Mark Shaneck, Yongdae Kim, Vipin Kumar
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
14 years 5 months ago
Learning and Approximating the Optimal Strategy to Commit To
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
Joshua Letchford, Vincent Conitzer, Kamesh Munagal...
MOC
2010
13 years 5 months ago
Analysis of a finite PML approximation to the three dimensional elastic wave scattering problem
We consider the application of a perfectly matched layer (PML) technique to approximate solutions to the elastic wave scattering problem in the frequency domain. The PML is viewed ...
James H. Bramble, Joseph E. Pasciak, Dimitar Trene...
CSFW
2007
IEEE
14 years 5 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...