Sciweavers

72 search results - page 3 / 15
» A Modular Method for Computing the Splitting Field of a Poly...
Sort
View
MOC
2000
94views more  MOC 2000»
13 years 5 months ago
Irreducibility testing over local fields
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
P. G. Walsh
CVPR
2005
IEEE
14 years 7 months ago
Segmentation of Edge Preserving Gradient Vector Flow: An Approach Toward Automatically Initializing and Splitting of Snakes
Active contours or snakes have been extensively utilized in handling image segmentation and classification problems. In traditional active contour models, snake initialization is ...
Chunming Li, Jundong Liu, Martin D. Fox
JSC
2002
61views more  JSC 2002»
13 years 5 months ago
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...
Emmanuel Thomé
FFA
2010
70views more  FFA 2010»
13 years 2 months ago
Fast arithmetic in unramified p-adic fields
Let p be prime and Zpn a degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast deterministic algorithms for common o...
Hendrik Hubrechts
SDMW
2004
Springer
13 years 11 months ago
Using Secret Sharing for Searching in Encrypted Data
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
Richard Brinkman, Jeroen Doumen, Willem Jonker