503 search results - page 38 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
133
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
143
Voted
ESA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
116
Voted
ORL
2008
15 years 3 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
138
Voted
IJSNET
2007
15 years 3 months ago
2007
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...
127
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...