Sciweavers

2434 search results - page 111 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 5 months ago
Differential Privacy and the Fat-Shattering Dimension of Linear Queries
In this paper, we consider the task of answering linear queries under the constraint of differential privacy. This is a general and well-studied class of queries that captures oth...
Aaron Roth
SDM
2008
SIAM
125views Data Mining» more  SDM 2008»
15 years 5 months ago
Mining and Ranking Generators of Sequential Patterns
Sequential pattern mining first proposed by Agrawal and Srikant has received intensive research due to its wide range applicability in many real-life domains. Various improvements...
David Lo, Siau-Cheng Khoo, Jinyan Li
97
Voted
ICDAR
2007
IEEE
15 years 9 months ago
Using Random Forests for Handwritten Digit Recognition
In the Pattern Recognition field, growing interest has been shown in recent years for Multiple Classifier Systems and particularly for Bagging, Boosting and Random Subspaces. Th...
Simon Bernard, Sébastien Adam, Laurent Heut...
144
Voted
OPODIS
2010
15 years 1 months ago
Application of Random Walks to Decentralized Recommender Systems
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...
Anne-Marie Kermarrec, Vincent Leroy, Afshin Moin, ...
138
Voted
STACS
2005
Springer
15 years 9 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning