Sciweavers

3454 search results - page 32 / 691
» Modern computer algebra
Sort
View
ISSAC
2005
Springer
101views Mathematics» more  ISSAC 2005»
14 years 3 months ago
Adherence is better than adjacency: computing the Riemann index using CAD
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...
James C. Beaumont, Russell J. Bradford, James H. D...
LICS
2006
IEEE
14 years 4 months ago
Boolean Algebras for Lambda Calculus
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
Giulio Manzonetto, Antonino Salibra
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
13 years 7 months ago
Enabling local computation for partially ordered preferences
Abstract. Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of val...
Hélène Fargier, Emma Rollon, Nic Wil...
ECCV
1998
Springer
14 years 12 months ago
Computation of the Quadrifocal Tensor
This paper gives a practical and accurate algorithm for the computation of the quadrifocal tensor and extraction of camera matrices from it. Previous methods for using the quadrifo...
Richard I. Hartley
FOCS
1991
IEEE
14 years 1 months ago
Computing Sums of Radicals in Polynomial Time
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
Johannes Blömer