Sciweavers

1400 search results - page 87 / 280
» On multiplication in finite fields
Sort
View
DCC
2005
IEEE
14 years 8 months ago
Quantization of Multiple Sources Using Integer Bit Allocation
Asymptotically optimal bit allocation among a set of quantizers for a finite collection of sources was determined in 1963 by Huang and Schultheiss. Their solution, however, gives ...
Benjamin Farber, Kenneth Zeger
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
14 years 2 months ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
WSC
1998
13 years 10 months ago
Sequential Allocations that Reduce Risk for Multiple Comparisons
We consider how to efficiently allocate computing resources in order to infer the best of a finite set of simulated systems, where best means that the system has the maximal expec...
Stephen E. Chick, Koichiro Inoue
DAGM
2010
Springer
13 years 10 months ago
Random Fourier Approximations for Skewed Multiplicative Histogram Kernels
Abstract. Approximations based on random Fourier features have recently emerged as an efficient and elegant methodology for designing large-scale kernel machines [4]. By expressing...
Fuxin Li, Catalin Ionescu, Cristian Sminchisescu
ICIP
2005
IEEE
14 years 10 months ago
Spatial domain analysis on the focus measurement for light field rendering
Light field rendering (LFR) is an image-based rendering method for synthesizing free-viewpoint images from a set of multi-view images. In LFR, no/little knowledge of geometry is r...
Keita Takahashi, Takeshi Naemura