Sciweavers

298 search results - page 5 / 60
» ideal 2010
Sort
View
ANTS
2010
Springer
250views Algorithms» more  ANTS 2010»
15 years 1 months ago
A Subexponential Algorithm for Evaluating Large Degree Isogenies
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
David Jao, Vladimir Soukharev
EOR
2002
66views more  EOR 2002»
14 years 9 months ago
Dynamic multi-objective heating optimization
We develop a multicriteria approach to the problem of space heating under a time varying price of electricity. In our dynamic goal programming model the goals are ideal temperatur...
Raimo P. Hämäläinen, Juha Mänt...
JSC
2010
63views more  JSC 2010»
14 years 4 months ago
A bound on the projective dimension of three cubics
We show that given any polynomial ring R over a field and any ideal J R which is generated by three cubic forms, the projective dimension of R/J is at most 36. We also settle the...
Bahman Engheta
MSCS
2010
103views more  MSCS 2010»
14 years 8 months ago
Iterative reflections of monads
Iterative monads, introduced by Calvin Elgot in the 1970’s, are those ideal monads in which every guarded system of recursive equations has a unique solution. For every ideal mon...
Jirí Adámek, Stefan Milius, Jiri Vel...
CVPR
2010
IEEE
15 years 3 months ago
Polynomial Shape from Shading
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
Ady Ecker, Allan Jepson