Sciweavers

5153 search results - page 241 / 1031
» Introduction to Randomized Algorithms
Sort
View
119
Voted
CP
2005
Springer
15 years 9 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
178
Voted
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 3 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
116
Voted
KDD
2002
ACM
128views Data Mining» more  KDD 2002»
16 years 3 months ago
Privacy preserving mining of association rules
We present a framework for mining association rules from transactions consisting of categorical items where the data has been randomized to preserve privacy of individual transact...
Alexandre V. Evfimievski, Ramakrishnan Srikant, Ra...
120
Voted
COLT
2005
Springer
15 years 9 months ago
Separating Models of Learning from Correlated and Uncorrelated Data
We consider a natural framework of learning from correlated data, in which successive examples used for learning are generated according to a random walk over the space of possibl...
Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andr...
135
Voted
DMKD
2004
ACM
136views Data Mining» more  DMKD 2004»
15 years 9 months ago
Mining association rules with non-uniform privacy concerns
Privacy concerns have become an important issue in data mining. A popular way to preserve privacy is to randomize the dataset to be mined in a systematic way and mine the randomiz...
Yi Xia, Yirong Yang, Yun Chi