2609 search results - page 81 / 522 » Optimizing for parallelism and data locality |
51
Voted
ICMCS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we consider the problem of optimal self-embedding Lapalcian data hiding for the state-dependent channels. In particular, we propose to decompose the Laplacian data ...
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
Automatic Global Data Partitioning for Distributed Memory Machines DMMs is a di cult problem. In this work, we present a partitioning strategy called 'Hyperplane Partitioning...
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
94
Voted
ICDM
2003
IEEE
15 years 5 months ago
2003
IEEE
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
90
Voted
GEOINFORMATICA
2006
15 years 17 days ago
2006
Existing estimation approaches for spatial databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, the...