503 search results - page 101 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
104
click to vote
BMCBI
2006
14 years 9 months ago
2006
Background: Multicategory Support Vector Machines (MC-SVM) are powerful classification systems with excellent performance in a variety of data classification problems. Since the p...