Sciweavers

4377 search results - page 82 / 876
» Mass problems and randomness
Sort
View
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
15 years 3 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
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
14 years 11 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
ECMDAFA
2009
Springer
109views Hardware» more  ECMDAFA 2009»
15 years 4 months ago
Uniform Random Generation of Huge Metamodel Instances
The size and the number of models is drastically increasing, preventing organizations from fully exploiting Model Driven Engineering benefits. Regarding this problem of scalabilit...
Alix Mougenot, Alexis Darrasse, Xavier Blanc, Mich...
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
15 years 3 months ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei
ICRA
2000
IEEE
86views Robotics» more  ICRA 2000»
15 years 2 months ago
Randomized Planning for Short Inspection Paths
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
Tim Danner, Lydia E. Kavraki