Sciweavers

14190 search results - page 274 / 2838
» computer 2008
Sort
View
ENTCS
2008
91views more  ENTCS 2008»
15 years 6 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
FUIN
2008
100views more  FUIN 2008»
15 years 6 months ago
Alias Types and Effects for "Environment-aware" Computations
We adapt the alias type technology to deal with primitives supporting environmentawareness (that is, the ability to adapt the behavior of according to the capabilities of the envi...
Ferruccio Damiani, Elena Giachino, Paola Giannini
IEICET
2008
61views more  IEICET 2008»
15 years 6 months ago
Powered Tate Pairing Computation
In this paper, we introduce a powered Tate pairing on a supersingular elliptic curve that has the same shortened loop as the modified Tate pairing using the eta pairing approach by...
Bo Gyeong Kang, Je Hong Park
MOR
2008
83views more  MOR 2008»
15 years 6 months ago
Extensive-Form Correlated Equilibrium: Definition and Computational Complexity
Abstract: This paper defines the extensive form correlated equilibrium (EFCE) for extensive games with perfect recall. The EFCE concept extends Aumann's strategic-form correla...
Bernhard von Stengel, Françoise Forges
SIGACT
2008
103views more  SIGACT 2008»
15 years 6 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke