5595 search results - page 131 / 1119 » Approximation Algorithms for Clustering Problems |
178
click to vote
ALGORITHMICA
2011
14 years 12 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
138
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
145
Voted
APPROX
1998
Springer
15 years 9 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
160
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
130
click to vote
TNN
2008
15 years 4 months ago
2008
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...