Sciweavers

257 search results - page 9 / 52
» On the Complexity of Computing Units in a Number Field
Sort
View
WSC
2008
13 years 11 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
ASIACRYPT
2006
Springer
14 years 10 days ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...
ISCAPDCS
2008
13 years 10 months ago
Implementation of 802.11n on 128-CORE Processor
This article presents the results of a research in applying modern Graphics Processing Units in the field of telecommunications. The most recent Wireless Local Area Network protoc...
A. Akapyev, V. Krylov
ICCV
1999
IEEE
14 years 10 months ago
The Hamilton-Jacobi Skeleton
The eikonal equation and variants of it are of significant interest for problems in computer vision and image processing. It is the basis for continuous versions of mathematical m...
Kaleem Siddiqi, Sylvain Bouix, Allen Tannenbaum, S...
EMMCVPR
1999
Springer
14 years 26 days ago
Auxiliary Variables for Markov Random Fields with Higher Order Interactions
Markov Random Fields are widely used in many image processing applications. Recently the shortcomings of some of the simpler forms of these models have become apparent, and models ...
Robin D. Morris