Sciweavers

257 search results - page 5 / 52
» On the Complexity of Computing Units in a Number Field
Sort
View
AAAI
2010
13 years 9 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
13 years 11 months ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama
CCCG
2007
13 years 9 months ago
Covering Points by Isothetic Unit Squares
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...
APCSAC
2004
IEEE
13 years 11 months ago
Dynamic Reallocation of Functional Units in Superscalar Processors
In the context of general-purpose processing, an increasing number of diverse functional units are added to cover a wide spectrum of applications. However, it is still possible to ...
Marc Epalza, Paolo Ienne, Daniel Mlynek
CVPR
2006
IEEE
14 years 9 months ago
Inferring Facial Action Units with Causal Relations
A system that could automatically analyze the facial actions in real time have applications in a number of different fields. However, developing such a system is always a challeng...
Yan Tong, Wenhui Liao, Qiang Ji