Sciweavers

1232 search results - page 185 / 247
» Digraphs: theory, algorithms and applications
Sort
View
PLDI
2004
ACM
14 years 2 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
ASIACRYPT
2004
Springer
14 years 2 months ago
Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
ATAL
2004
Springer
14 years 2 months ago
Experiments on Deliberation Equilibria in Auctions
Auctions are useful mechanisms for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders know their own valua...
Kate Larson, Tuomas Sandholm
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
14 years 2 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
DIALM
2003
ACM
99views Algorithms» more  DIALM 2003»
14 years 2 months ago
Spatio-temporal data reduction with deterministic error bounds
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
Hu Cao, Ouri Wolfson, Goce Trajcevski