11345 search results - page 1851 / 2269 » Foundations of Computer Science |
132
click to vote
ACMSE
2010
ACM
15 years 2 months ago
2010
ACM
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
220
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
177
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
155
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--We consider statistical data analysis in the interactive setting. In this setting a trusted curator maintains a database of sensitive information about individual partici...
146
click to vote
GI
2010
Springer
15 years 2 months ago
2010
Springer
: Social networks and communities like facebook and myspace gain increasing importance in people's everyday lives. Companies start to see these platforms as a chance for commu...