39 search results - page 4 / 8 » Finding Biclusters by Random Projections |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
ACISICIS
2008
IEEE
14 years 11 months ago
2008
IEEE
Compressed sensing (CS), a joint compression and sensing process, is a emerging field of activity in which the signal is sampled and simultaneously compressed at a greatly reduced...
AAAI
2008
14 years 11 months ago
2008
Most manifold learning methods consider only one similarity matrix to induce a low-dimensional manifold embedded in data space. In practice, however, we often use multiple sensors...
ACSC
2009
IEEE
15 years 4 months ago
2009
IEEE
Numerous studies have used historical datasets to build and validate models for estimating software development effort. Very few used a chronological split (where projects’ end ...
110
Voted
IEEECGIV
2009
IEEE
15 years 4 months ago
2009
IEEE
The theory of compressive sampling involves making random linear projections of a signal. Provided signal is sparse in some basis, small number of such measurements preserves the ...