6181 search results - page 585 / 1237 » Transactional Cluster Computing |
208
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
214
click to vote
AAAI
2008
15 years 9 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
197
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Ionic current blockade signal processing, for use in nanopore detection, offers a promising new way to analyze single molecule properties with potential implications f...
271
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
222
click to vote
ISPASS
2003
IEEE
16 years 14 days ago
2003
IEEE
Emerging application domains such as interactive vision, animation, and multimedia collaboration display dynamic scalable parallelism, and high computational requirements, making ...