503 search results - page 71 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
128
click to vote
STOC
1992
ACM
15 years 7 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
139
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate...
113
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
The paper is concerned with the problem of question recommendation. Specifically, given a question as query, we are to retrieve and rank other questions according to their likelih...
143
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
129
click to vote
COMCOM
2007
15 years 3 months ago
2007
This paper addresses the issue of provisioning end-to-end bandwidth guarantees across multiple Autonomous Systems (ASes). We first review a cascaded model for negotiating and est...