Sciweavers

304 search results - page 11 / 61
» An Efficient Method for Evaluating Complex Polynomials
Sort
View
NIPS
2008
13 years 10 months ago
Bayesian Kernel Shaping for Learning Control
In kernel-based regression learning, optimizing each kernel individually is useful when the data density, curvature of regression surfaces (or decision boundaries) or magnitude of...
Jo-Anne Ting, Mrinal Kalakrishnan, Sethu Vijayakum...
ISSS
1999
IEEE
151views Hardware» more  ISSS 1999»
14 years 1 months ago
Optimized System Synthesis of Complex RT Level Building Blocks from Multirate Dataflow Graphs
In order to cope with the ever increasing complexity of todays application specific integrated circuits, a building block based design methodology is established. The system is co...
Jens Horstmannshoff, Heinrich Meyr
TC
2008
13 years 9 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
ICC
2007
IEEE
142views Communications» more  ICC 2007»
14 years 3 months ago
Reduced-Complexity Cluster Modelling for the 3GPP Channel Model
—The realistic performance of a multi-input multi-output (MIMO) communication system depends strongly on the spatial correlation properties introduced by clustering in the propag...
Hui Xiao, Alister G. Burr, Rodrigo C. de Lamare
IMAGING
2004
13 years 10 months ago
Maintaining an Accurate Printer Characterization
In this study, the problem of updating a printer characterization in response to systematic changes in print-device characteristics is addressed with two distinct approaches: the ...
David Littlewood, Ganesh Subbarayan