340 search results - page 32 / 68 » A New Algorithm for the Construction of Optimal B-Trees |
CGO
2011
IEEE
12 years 11 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
IPPS
2000
IEEE
14 years 1 days ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
IPL
2008
13 years 7 months ago
2008
An optimal labeling where labels are disjoint axis-parallel equal-size squares is called 2PM labeling if the labels have maximum length each attached to its corresponding point on...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...