59 search results - page 9 / 12 » The volume algorithm revisited: relation with bundle methods |
SODA
1993
ACM
14 years 10 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
101
click to vote
SEBD
2003
14 years 10 months ago
2003
Abstract. The management of user preferences is becoming a fundamental ingredient of modern Web-based data-intensive applications, in which information filtering is crucial to red...
SIGGRAPH
1999
ACM
15 years 1 months ago
1999
ACM
In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable ...
78
Voted
CEEMAS
2007
Springer
15 years 3 months ago
2007
Springer
We present a multi-agent system designed to detect malicious traffic in high-speed networks. In order to match the performance requirements related to the traffic volume, the net...
73
Voted
VG
2003
14 years 10 months ago
2003
We present new implementations of the Maximum Likelihood Expectation Maximization (EM) algorithm and the related Ordered Subset EM (OSEM) algorithm. Our implementation is based on...