Sciweavers

1599 search results - page 162 / 320
» Probabilistic Analysis of Anonymity
Sort
View
142
Voted
RSKT
2009
Springer
15 years 10 months ago
Learning Optimal Parameters in Decision-Theoretic Rough Sets
A game-theoretic approach for learning optimal parameter values for probabilistic rough set regions is presented. The parameters can be used to define approximation regions in a p...
Joseph P. Herbert, Jingtao Yao
120
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
126
Voted
ISDA
2008
IEEE
15 years 10 months ago
Performance Comparison of ADRS and PCA as a Preprocessor to ANN for Data Mining
In this paper we compared the performance of the Automatic Data Reduction System (ADRS) and principal component analysis (PCA) as a preprocessor to artificial neural networks (ANN...
Nicholas Navaroli, David Turner, Arturo I. Concepc...
138
Voted
PRDC
2008
IEEE
15 years 10 months ago
On the Complexity of a Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
Julien Clement, Thomas Hérault, Stép...
123
Voted
ECSQARU
2007
Springer
15 years 9 months ago
Interpreting Belief Functions as Dirichlet Distributions
Traditional Dempster Shafer belief theory does not provide a simple method for judging the effect of statistical and probabilistic data on belief functions and vice versa. This put...
Audun Jøsang, Zied Elouedi