10457 search results - page 154 / 2092 » Data Mapping as Search |
173
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
219
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
215
click to vote
DASFAA
2008
IEEE
15 years 8 months ago
2008
IEEE
An important issue arising from XML query relaxation is how to efficiently search the top-k best answers from a large number of XML data sources, while minimizing the searching cos...
147
click to vote
TVCG
2008
15 years 6 months ago
2008
Abstract-- A typical data-driven visualization of electroencephalography (EEG) coherence is a graph layout, with vertices representing electrodes and edges representing significant...
176
click to vote
WEA
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. A major task in evolutionary biology is to determine the ancestral relationships among the known species, a process generally referred as phylogenetic reconstruction. In ...