15485 search results - page 634 / 3097 » Computing Optimal Subsets |
195
click to vote
QEST
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper we consider Quasi-Birth-and-Death (QBD) processes where the upward (resp. downward) transitions are restricted to occur only from (resp. to) a subset of the phase ...
172
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
197
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
190
click to vote
SAMT
2009
Springer
16 years 1 months ago
2009
Springer
This paper describes an automatic annotation, or autotagging, algorithm that attaches textual tags to 3D models based on their shape and semantic classes. The proposed method emplo...
191
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
The class imbalance is a critical problem in classification tasks related to many real world applications. A large number of solutions were proposed in literature, both at the al...