Sciweavers

3096 search results - page 262 / 620
» The Generalized FITC Approximation
Sort
View
EVOW
2009
Springer
15 years 4 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
ICC
2009
IEEE
210views Communications» more  ICC 2009»
15 years 4 months ago
Novel Preamble-Based Channel Estimation for OFDM/OQAM Systems
OFDM/OQAM has been considered as an attractive alternative to classic OFDM with cyclic prefix (CP) over doubly dispersive channels. By utilising well designed pulse shapes and remo...
Jinfeng Du, Svante Signell
146
Voted
ALGORITHMS
2010
113views more  ALGORITHMS 2010»
15 years 3 months ago
A Complete Theory of Everything (Will Be Subjective)
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
Marcus Hutter
CGF
2010
135views more  CGF 2010»
15 years 3 months ago
Interactive Rendering of Non-Constant, Refractive Media Using the Ray Equations of Gradient-Index Optics
Existing algorithms can efficiently render refractive objects of constant refractive index. For a medium with a continuously varying index of refraction, most algorithms use the r...
Chen Cao, Zhong Ren, Baining Guo, Kun Zhou
CGF
2011
14 years 9 months ago
A Sparse Parametric Mixture Model for BTF Compression, Editing and Rendering
Bidirectional texture functions (BTFs) represent the appearance of complex materials. Three major shortcomings with BTFs are the bulky storage, the difficulty in editing and the ...
Hongzhi Wu, Julie Dorsey, Holly E. Rushmeier