Sciweavers

5115 search results - page 233 / 1023
» On Randomized Lanczos Algorithms
Sort
View
186
Voted
ACL
2009
15 years 4 months ago
Answering Opinion Questions with Random Walks on Graphs
Opinion Question Answering (Opinion QA), which aims to find the authors' sentimental opinions on a specific target, is more challenging than traditional factbased question an...
Fangtao Li, Yang Tang, Minlie Huang, Xiaoyan Zhu
185
Voted
CP
2005
Springer
16 years 17 days 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
242
Voted
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 7 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
176
Voted
KDD
2002
ACM
128views Data Mining» more  KDD 2002»
16 years 7 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...
186
Voted
COLT
2005
Springer
16 years 17 days 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...