15485 search results - page 153 / 3097 » Computing Optimal Subsets |
126
Voted
AI
1998
Springer
15 years 2 months ago
1998
Springer
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
118
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
92
Voted
COMPUTING
2000
15 years 2 months ago
2000
143
Voted
ICIP
2003
IEEE
16 years 4 months ago
2003
IEEE
We present algorithms for automatic feature selection for unsupervised structure discovery from video sequences. Feature selection in this scenario is hard because of the absence ...
117
Voted
ICPR
2000
IEEE
15 years 7 months ago
2000
IEEE
A new sub-optimal subset search method for feature selection is introduced. As opposed to other till now known subset selection methods the oscillating search is not dependent on ...