145 search results - page 2 / 29 » Fast, Randomized Join-Order Selection - Why Use Transformati... |
STOC
2006
ACM
14 years 7 months ago
2006
ACM
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 ...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we propose a new joint encryption and lossless compression technique designed for large images 1 . The proposed technique takes advantage of the Mojette transform pr...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
CSB
2003
IEEE
14 years 22 days ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...