Sciweavers

257 search results - page 7 / 52
» On the Complexity of Computing Units in a Number Field
Sort
View
AIIDE
2008
13 years 9 months ago
The Rise of Potential Fields in Real Time Strategy Bots
Bots for Real Time Strategy (RTS) games are challenging to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while at the s...
Johan Hagelbäck, Stefan J. Johansson
PAMI
2007
144views more  PAMI 2007»
13 years 7 months ago
Facial Action Unit Recognition by Exploiting Their Dynamic and Semantic Relationships
—A system that could automatically analyze the facial actions in real time has applications in a wide range of different fields. However, developing such a system is always chall...
Yan Tong, Wenhui Liao, Qiang Ji
BMCBI
2008
99views more  BMCBI 2008»
13 years 7 months ago
Towards a lightweight generic computational grid framework for biological research
Background: An increasing number of scientific research projects require access to large-scale computational resources. This is particularly true in the biological field, whether ...
Mark D. Halling-Brown, David S. Moss, Adrian J. Sh...
SIGCSE
2006
ACM
355views Education» more  SIGCSE 2006»
14 years 1 months ago
Why students with an apparent aptitude for computer science don't choose to major in computer science
The statistics show that the number of Computer Science majors is dropping across the United States. Possible reasons include a reduced number of jobs in the field, an incorrect p...
Lori Carter
MOC
2000
94views more  MOC 2000»
13 years 7 months ago
Irreducibility testing over local fields
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
P. G. Walsh