We consider the problem of designing an allocation rule or an “online learning algorithm” for a class of bandit problems in which the set of control actions available at each time t is a convex, compact subset of R. Upon choosing an action x at time t, the algorithm obtains a noisy value of the unknown and time-varying function ft evaluated at x. The “regret” of an algorithm is the gap between ...

Short-run and long-run relations among time series can differ. In situations in which short-run constraints and information biases obscure equilibrium relations among economic variables, estimates of the long-run relations, which are free of such contaminations, become the only basis for evaluating economic hypotheses. The common approach to estimating long-run predictability has been long-hori...

Storyboard consisting of key-frames is a popular format of video summarization as it helps in efficient indexing, browsing and partial or complete retrieval of video. In this paper, we have presented a size constrained storyboard generation scheme. Given the shots i.e. the output of the video segmentation process, the method has two major steps: extraction of appropriate key-frame(s) from each ...

Store-and-generate techniques encode a given test set and regenerate the original test set during test with the help of a decoder. They are particularly suitable for IP cores coming with pre-computed test sets, and they also offer a natural option for test resource partitioning, because the encoded test data can be stored either on or off chip. Previous research has focused on run-length coding...