48 search results - page 6 / 10 » Maximum normalized spacing for efficient visual clustering |
BMCBI
2010
14 years 9 months ago
2010
Background: Visualization of DNA microarray data in two or three dimensional spaces is an important exploratory analysis step in order to detect quality issues or to generate new ...
CCGRID
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper is concerned with efficient querying of very large multi-resolution datasets on storage and compute clusters. We present a suite of services that support storage, index...
108
click to vote
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
NAACL
2003
14 years 11 months ago
2003
e by placing terms in an abstract ‘information space’ based on their occurrences in text corpora, and then allowing a user to visualize local regions of this information space....
166
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper, we will look at substructure clustering of sequential 3d objects. A sequential 3d object is a set of points located in a three dimensional space that are linked up ...