2228 search results - page 185 / 446 » Distributed Data Clustering Can Be Efficient and Exact |
139
click to vote
TPDS
2008
15 years 6 months ago
2008
We present NRMI: a drop-in replacement for Java RMI that supports call-by-copy-restore semantics for arbitrary linked data structures, in addition to regular call-by-copy semantic...
140
click to vote
NAS
2007
IEEE
16 years 27 days ago
2007
IEEE
: SAN-level caching can manage caching within a global view so that global hot data can be identified and cached. However, two problems may be encountered in the existing SAN-level...
174
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
188
click to vote
CLUSTER
2005
IEEE
16 years 7 days ago
2005
IEEE
The amount of data collected and stored in databases is growing considerably for almost all areas of human activity. Processing this amount of data is very expensive, both humanly...
182
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The unsupervised discovery of structures (i.e. clusterings) underlying data is a central issue in several branches of bioinformatics. Methods based on the concept of s...