Sciweavers

811 search results - page 3 / 163
» Avoiding Approximate Squares
Sort
View
JGTOOLS
2008
109views more  JGTOOLS 2008»
13 years 7 months ago
Fast Equal-Area Mapping of the (Hemi)Sphere using SIMD
We present a fast vectorized implementation of a transform that maps points in the unit square to the surface of the sphere, while preserving fractional area. The mapping uses the ...
Petrik Clarberg
PROCEDIA
2010
123views more  PROCEDIA 2010»
13 years 5 months ago
Mean square convergence of a semidiscrete scheme for SPDEs of Zakai type driven by square integrable martingales
In this short note, a direct proof of L2 convergence of an Euler–Maruyama approximation of a Zakai equation driven by a square integrable martingale is shown. The order of conve...
Annika Lang
ASAP
2009
IEEE
119views Hardware» more  ASAP 2009»
13 years 10 months ago
A Low Power High Performance Radix-4 Approximate Squaring Circuit
An implementation of a radix-4 approximate squaring circuit is described employing a new operand dual recoding technique. Approximate squaring circuits have numerous applications ...
Satyendra R. Datla, Mitchell A. Thornton, David W....
ECAI
2006
Springer
13 years 11 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
IPCO
2008
129views Optimization» more  IPCO 2008»
13 years 9 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba