Sciweavers

5606 search results - page 46 / 1122
» Randomization Techniques for Graphs.
Sort
View
ALGORITHMICA
2010
147views more  ALGORITHMICA 2010»
13 years 9 months ago
Note on the Structure of Kruskal's Algorithm
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
Nicolas Broutin, Luc Devroye, Erin McLeish
VTS
2005
IEEE
102views Hardware» more  VTS 2005»
14 years 2 months ago
An Efficient Random Jitter Measurement Technique Using Fast Comparator Sampling
This paper describes a random jitter measurement technique using simple algorithms and comparator sampling. The approach facilitates using Automated Test Equipment (ATE) to valida...
Dongwoo Hong, Cameron Dryden, Gordon Saksena
MCS
2004
Springer
14 years 2 months ago
A Comparison of Ensemble Creation Techniques
We experimentally evaluate bagging and six other randomization-based approaches to creating an ensemble of decision-tree classifiers. Bagging uses randomization to create multipl...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
WPES
2003
ACM
14 years 2 months ago
Analysis of privacy preserving random perturbation techniques: further explorations
Privacy is becoming an increasingly important issue in many data mining applications, particularly in the security and defense area. This has triggered the development of many pri...
Haimonti Dutta, Hillol Kargupta, Souptik Datta, Kr...
ICDM
2003
IEEE
142views Data Mining» more  ICDM 2003»
14 years 2 months ago
Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques
Collaborative Filtering (CF) techniques are becoming increasingly popular with the evolution of the Internet. E-commerce sites use CF systems to suggest products to customers base...
Huseyin Polat, Wenliang Du