The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
In this paper a study of some structural features of handwritten letter ‘a’ is presented. The features under consideration are structural, style and formation features documen...
Philip Jonathan Sutanto, Graham Leedham, Vladimir ...
The paging algorithm Least Recently Used Second Last Request (LRU-2) was proposed for use in database disk buffering and shown experimentally to perform better than Least Recently ...
Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S...
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
Andrew A. Lamb, William Thies, Saman P. Amarasingh...