Sciweavers

3890 search results - page 48 / 778
» Computation of unirational fields
Sort
View
109
Voted
JSC
2002
61views more  JSC 2002»
15 years 3 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é
155
Voted
WSC
2008
15 years 6 months ago
Efficient simulation for tail probabilities of Gaussian random fields
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
Robert J. Adler, Jose Blanchet, Jingchen Liu
MOC
2002
73views more  MOC 2002»
15 years 3 months ago
Evaluation of zeta function of the simplest cubic field at negative odd integers
Abstract. In this paper, we are interested in the evaluation of the zeta function of the simplest cubic field. We first introduce Siegel's formula for values of the zeta funct...
Hyun Kwang Kim, Jung Soo Kim
ANTS
2008
Springer
106views Algorithms» more  ANTS 2008»
15 years 6 months ago
Computing in Component Groups of Elliptic Curves
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
J. E. Cremona
ICIP
2005
IEEE
15 years 9 months ago
Light field capturing with lensless cameras
We introduce a novel approach to capturing light field with lensless cameras. By moving the cameras back and forth, we capture a set of images. We show that it is possible to reco...
Cha Zhang, Tsuhan Chen