4110 search results - page 174 / 822 » Efficient algorithms for the 2-gathering problem |
149
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolut...
187
click to vote
OPODIS
2001
15 years 7 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
171
click to vote
PRL
2008
15 years 6 months ago
2008
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
166
click to vote
IAJIT
2010
15 years 5 months ago
2010
: One of the fundamental issues in computer science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal o...
188
click to vote
IAJIT
2010
15 years 5 months ago
2010
: Sorting is considered as one of the important issues of computer science. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of res...