503 search results - page 18 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
100
click to vote
EVOW
2001
Springer
15 years 4 months ago
2001
Springer
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
111
click to vote
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of...
104
click to vote
VLSISP
2002
14 years 11 months ago
2002
Dimensionality reduction is an important problem in pattern recognition. There is a tendency of using more and more features to improve the performance of classifiers. However, not...
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
73
Voted
ICCD
2004
IEEE
15 years 8 months ago
2004
IEEE
The increasing clock frequencies in high-end industrial circuits bring new routing challenges that can not be handled by traditional algorithms. An important design automation pro...