Let F(n) be a family of partitions of n and let F(n d) denote the set of partitions in F(n) with Durfee square of size d. We de ne the Durfee polynomial of F(n) to be the polynomi...
E. Rodney Canfield, Sylvie Corteel, Carla D. Savag...
Transform approximations are explored for speeding up the software compression of images and video. Approximations are used to replace the regular discrete cosine transform (DCT) w...
In this paper we present a practical implementation of a multiuser technical laboratory that combines Artificial Intelligence (AI) and Bluetooth (BT) techniques. The objective is ...
We describe the experience of using a combination of requirements engineering techniques (scenarios, storyboards, observation and workshops) in an escience application to develop ...
Sarah Thew, Alistair G. Sutcliffe, Oscar de Bruijn...
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...