2383 search results - page 189 / 477 » Finding Representative Set from Massive Data |
151
click to vote
ISBI
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper, a new framework for brain warping via landmark matching is proposed using implicit representations or the level set method. We demonstrate this powerful technique b...
136
click to vote
ICTAI
2006
IEEE
15 years 11 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
151
click to vote
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Mining data streams is important in both science and commerce. Two major challenges are (1) the data may grow without limit so that it is difficult to retain a long history; and (...
152
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: Serial analysis of gene expression (SAGE) is used to obtain quantitative snapshots of the transcriptome. These profiles are count-based and are assumed to follow a Bin...
148
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Over the last 2-3 years, the importance of data-intensive computing has increasingly been recognized, closely coupled with the emergence and popularity of map-reduce for developin...