Sciweavers

1013 search results - page 160 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
BMCBI
2005
81views more  BMCBI 2005»
13 years 9 months ago
Evolutionary sequence analysis of complete eukaryote genomes
Background: Gene duplication and gene loss during the evolution of eukaryotes have hindered attempts to estimate phylogenies and divergence times of species. Although current meth...
Jaime E. Blair, Prachi Shah, S. Blair Hedges
CCGRID
2009
IEEE
14 years 4 months ago
Multi-scale Real-Time Grid Monitoring with Job Stream Mining
—The ever increasing scale and complexity of large computational systems ask for sophisticated management tools, paving the way toward Autonomic Computing. A first step toward A...
Xiangliang Zhang, Michèle Sebag, Céc...
SOSP
1997
ACM
13 years 10 months ago
Automated Hoarding for Mobile Computers
A common problem facing mobile computing is disconnected operation, or computing in the absence of a network. Hoarding eases disconnected operation by selecting a subset of the us...
Geoffrey H. Kuenning, Gerald J. Popek
CORR
2008
Springer
158views Education» more  CORR 2008»
13 years 9 months ago
Improved Smoothed Analysis of the k-Means Method
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
Bodo Manthey, Heiko Röglin
EDBT
1998
ACM
155views Database» more  EDBT 1998»
14 years 1 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...