Sciweavers

513 search results - page 32 / 103
» Reduction Transformations in ORM
Sort
View
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 5 days 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
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
16 years 15 hour ago
SHIFT-SPLIT: I/O Efficient Maintenance of Wavelet-Transformed Multidimensional Data
The Discrete Wavelet Transform is a proven tool for a wide range of database applications. However, despite broad acceptance, some of its properties have not been fully explored a...
Mehrdad Jahangiri, Dimitris Sacharidis, Cyrus Shah...
IEAAIE
2009
Springer
15 years 6 months ago
Robust Singular Spectrum Transform
Change Point Discovery is a basic algorithm needed in many time series mining applications including rule discovery, motif discovery, casual analysis, etc. Several techniques for c...
Yasser F. O. Mohammad, Toyoaki Nishida
CVPR
2007
IEEE
16 years 1 months ago
Trace Ratio vs. Ratio Trace for Dimensionality Reduction
A large family of algorithms for dimensionality reduction end with solving a Trace Ratio problem in the form of arg maxW Tr(WT SpW)/Tr(WT SlW)1 , which is generally transformed in...
Huan Wang, Shuicheng Yan, Dong Xu, Xiaoou Tang, Th...
AGTIVE
2003
Springer
15 years 5 months ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman