Sciweavers

614 search results - page 46 / 123
» DE in Slovenia: Where are We
Sort
View
COMBINATORICS
1998
93views more  COMBINATORICS 1998»
13 years 7 months ago
Durfee Polynomials
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...
TCSV
2002
88views more  TCSV 2002»
13 years 7 months ago
Variable complexity DCT approximations driven by an HVQ-based analyzer
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...
Ricardo L. de Queiroz
IJCSA
2008
104views more  IJCSA 2008»
13 years 7 months ago
Artificial Intelligence and Bluetooth Techniques in a Multi-user M-learning Domain
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 ...
Bonifacio Castaño, Angel Moreno, Melquiades...
RE
2008
Springer
13 years 7 months ago
Experience in e-Science Requirements Engineering
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...
ATMOS
2010
308views Optimization» more  ATMOS 2010»
13 years 6 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
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...
Marcus Poggi de Aragão, Henrique Viana, Edu...