8647 search results - page 710 / 1730 » The Container Selection Problem |
179
click to vote
SIAMCOMP
2000
15 years 7 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
208
click to vote
CORR
1998
Springer
15 years 7 months ago
1998
Springer
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
178
click to vote
ICFEM
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available...
222
click to vote
PAMI
2010
15 years 5 months ago
2010
—A common way to model multiclass classification problems is to design a set of binary classifiers and to combine them. Error-Correcting Output Codes (ECOC) represent a successfu...
195
click to vote
SIAMDM
2010
15 years 5 months ago
2010
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...