Sciweavers

3890 search results - page 24 / 778
» Computation of unirational fields
Sort
View
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
14 years 3 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur
VISUALIZATION
2002
IEEE
14 years 2 months ago
Tensor Field Visualisation using Adaptive Filtering of Noise Fields combined with Glyph Rendering
While many methods exist for visualising scalar and vector data, visualisation of tensor data is still troublesome. We present a method for visualising second order tensors in thr...
Andreas Sigfridsson, Tino Ebbers, Einar Heiberg, L...
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
14 years 3 months ago
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Senjuti Basu Roy, Gautam Das, Sajal Das
ISSAC
2004
Springer
94views Mathematics» more  ISSAC 2004»
14 years 3 months ago
Algorithms for polynomial GCD computation over algebraic function fields
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
Mark van Hoeij, Michael B. Monagan
ICISC
2004
120views Cryptology» more  ICISC 2004»
13 years 11 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua