Sciweavers

3890 search results - page 67 / 778
» Computation of unirational fields
Sort
View
CIE
2009
Springer
15 years 11 months ago
Decidability of Sub-theories of Polynomials over a Finite Field
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
Alla Sirokofskich
AINA
2006
IEEE
15 years 10 months ago
Communication between Outdoor Field and Immersive Virtual Environment
This paper proposes the concept of the hybrid information space that integrates the information space seamlessly between the real world and the virtual world, and the prototype sy...
Tetsuro Ogi, Tetsuro Fujise
ICPR
2006
IEEE
15 years 10 months ago
Extending the Depth of Field in a Compound-Eye Imaging System with Super-Resolution Reconstruction
Optical device miniaturization is highly desirable in many applications. Direct down-scaling of traditional imaging system is one approach, but the extent to which it can be minim...
Wai-San Chan, Edmund Y. Lam, Michael K. Ng
ISORC
2005
IEEE
15 years 10 months ago
An Automated Distributed Infrastructure for Collecting Bluetooth Field Failure Data
The widespread use of mobile and wireless computing platforms is leading to a growing interest on dependability issues. Several research studies have been conducted on dependabili...
Marcello Cinque, Fabio Cornevilli, Domenico Cotron...
FQ
2003
Springer
15 years 9 months ago
Everywhere Ramified Towers of Global Function Fields
We construct a tower of function fields F0 ⊂ F1 ⊂ . . . over a finite field such that every place of every Fi ramifies in the tower and lim genus(Fi)/[Fi : F0] < ∞. We...
Iwan M. Duursma, Bjorn Poonen, Michael Zieve