5046 search results - page 835 / 1010 » Non-redundant data clustering |
280
click to vote
GIS
2008
ACM
16 years 8 months ago
2008
ACM
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...
225
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
185
click to vote
ICCAD
2003
IEEE
16 years 4 months ago
2003
IEEE
— Memory-intensive applications present unique challenges to an ASIC designer in terms of the choice of memory organization, memory size requirements, bandwidth and access latenc...
244
click to vote
ICDCS
2006
IEEE
16 years 1 months ago
2006
IEEE
Distributed storage systems employ replicas or erasure code to ensure high reliability and availability of data. Such replicas create great amount of network traffic that negative...
197
click to vote
CCGRID
2005
IEEE
16 years 25 days ago
2005
IEEE
ABSTRACT. Objectives. This paper addresses Grid-based integration and access of distributed data from infectious disease patient databases, literature on in-vitro and in-vivo pharm...