Sciweavers

712 search results - page 12 / 143
» A mixture model for random graphs
Sort
View
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
14 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
APPROX
2008
Springer
125views Algorithms» more  APPROX 2008»
14 years 10 days ago
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
ICML
2006
IEEE
14 years 11 months ago
Graph model selection using maximum likelihood
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
Adam Kalai, Ivona Bezáková, Rahul Sa...
TASLP
2010
117views more  TASLP 2010»
13 years 5 months ago
Speech Enhancement Using Gaussian Scale Mixture Models
This paper presents a novel probabilistic approach to speech enhancement. Instead of a deterministic logarithmic relationship, we assume a probabilistic relationship between the fr...
Jiucang Hao, Te-Won Lee, Terrence J. Sejnowski
UIST
2010
ACM
13 years 8 months ago
Mixture model based label association techniques for web accessibility
An important aspect of making the Web accessible to blind users is ensuring that all important web page elements such as links, clickable buttons, and form fields have explicitly ...
Muhammad Asiful Islam, Yevgen Borodin, I. V. Ramak...