Sciweavers

54 search results - page 6 / 11
» Sublinear-Time Approximation for Clustering Via Random Sampl...
Sort
View
158
Voted
ML
2008
ACM
248views Machine Learning» more  ML 2008»
15 years 1 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
16 years 2 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
109
Voted
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
13 years 4 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 2 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
ICC
2007
IEEE
137views Communications» more  ICC 2007»
15 years 8 months ago
On the Simulation of Tikhonov Random Processes
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
Giuseppe Thadeu Freitas de Abreu