2996 search results - page 487 / 600 » Numberings and Randomness |
196
click to vote
TEC
2008
15 years 6 months ago
2008
In general, the analysis of microarray data requires two steps: feature selection and classification. From a variety of feature selection methods and classifiers, it is difficult t...
130
click to vote
TIT
2008
15 years 6 months ago
2008
In this paper, coding theorems on the (t; m)-threshold scheme for a general source are discussed, where m means the number of the shares and t means a threshold. The (t; m)-thresho...
159
click to vote
JAIR
2007
15 years 6 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
177
click to vote
JAIR
2007
15 years 6 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
155
click to vote
TIT
2008
15 years 6 months ago
2008
In this paper, we consider a constrained sequential resource allocation problem where an individual needs to accomplish a task by repeatedly guessing/investing a sufficient level o...