518 search results - page 40 / 104 » Towards Distributed Algorithm Portfolios |
125
click to vote
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
15 years 1 months ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
ICDCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Data mining systems aim to discover patterns and extract useful information from facts recorded in databases. A widely adopted approach is to apply machine learning algorithms to ...
SDM
2010
SIAM
14 years 11 months ago
2010
SIAM
We propose a new decision tree algorithm, Class Confidence Proportion Decision Tree (CCPDT), which is robust and insensitive to class distribution and generates rules which are st...
93
Voted
SIGCOMM
2005
ACM
15 years 3 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
72
Voted
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...