Sciweavers

9359 search results - page 249 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
15 years 10 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
Sumit Ganguly
132
Voted
I3
2007
15 years 6 months ago
Referent Tracking and its Applications
Referent tracking (RT) is a new paradigm, based on unique identification, for representing and keeping track of particulars. It was first introduced to support the entry and retri...
Werner Ceusters, Barry Smith
151
Voted
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 5 months ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 5 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
SAC
2004
ACM
15 years 10 months ago
Guiding motif discovery by iterative pattern refinement
In this paper, we demonstrate that the performance of a motif discovery algorithm can be significantly improved by embedding it into a novel framework that effectively guides the ...
Zhiping Wang, Mehmet M. Dalkilic, Sun Kim