Sciweavers

3096 search results - page 217 / 620
» The Generalized FITC Approximation
Sort
View
CGF
1999
159views more  CGF 1999»
15 years 4 months ago
Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids
Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing th...
João Comba, James T. Klosowski, Nelson L. M...
TIT
2002
129views more  TIT 2002»
15 years 4 months ago
Arbitrary source models and Bayesian codebooks in rate-distortion theory
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
Ioannis Kontoyiannis, Junshan Zhang
ML
2007
ACM
106views Machine Learning» more  ML 2007»
15 years 4 months ago
Surrogate maximization/minimization algorithms and extensions
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
FS
2010
148views more  FS 2010»
15 years 3 months ago
Option hedging for small investors under liquidity costs
Following the framework of C¸etin, Jarrow and Protter [4] we study the problem of super-replication in presence of liquidity costs under additional restrictions on the gamma of th...
Umut Çetin, H. Mete Soner, Nizar Touzi
GPEM
2010
180views more  GPEM 2010»
15 years 3 months ago
Developments in Cartesian Genetic Programming: self-modifying CGP
Abstract Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming....
Simon Harding, Julian F. Miller, Wolfgang Banzhaf