Sciweavers

4451 search results - page 113 / 891
» On Random Ordering Constraints
Sort
View
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
15 years 9 months ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Michael Yu Zhu, Lei Liu
APJOR
2010
118views more  APJOR 2010»
15 years 2 months ago
Alternative Randomization for Valuing American Options
This paper provides a fast and accurate randomization algorithm for valuing American puts and calls on dividend-paying stocks and their early exercise boundaries. The primal focus...
Toshikazu Kimura
RC
2006
88views more  RC 2006»
15 years 4 months ago
Geometric Constructions with Discretized Random Variables
We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimension...
Hans-Peter Schröcker, Johannes Wallner
MEDINFO
2007
102views Healthcare» more  MEDINFO 2007»
15 years 5 months ago
Automatic Treatment of Temporal Issues in Clinical Guidelines in the GLARE System
Temporal constraints play a fundamental role in clinical guidelines. For example, temporal indeterminacy, constraints about duration, delays between actions and periodic repetitio...
Luca Anselma, Paolo Terenziani, Stefania Montani, ...
SPAA
2010
ACM
15 years 9 months ago
Multi-sided shared coins and randomized set-agreement
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...
Keren Censor Hillel