Sciweavers

2520 search results - page 240 / 504
» The complexity of approximating entropy
Sort
View
HAIS
2009
Springer
15 years 11 months ago
Pareto-Based Multi-output Model Type Selection
In engineering design the use of approximation models (= surrogate models) has become standard practice for design space exploration, sensitivity analysis, visualization and optimi...
Dirk Gorissen, Ivo Couckuyt, Karel Crombecq, Tom D...
WINE
2009
Springer
147views Economy» more  WINE 2009»
15 years 11 months ago
Computational Aspects of Multimarket Price Wars
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
Nithum Thain, Adrian Vetta
APGV
2007
ACM
131views Visualization» more  APGV 2007»
15 years 10 months ago
Is accurate occlusion of glossy reflections necessary?
Much research in recent times has been conducted towards realtime rendering of accurate glossy reflections under direct, natural illumination including correct occlusions. The vie...
Oscar Kozlowski, Jan Kautz
FSE
2000
Springer
96views Cryptology» more  FSE 2000»
15 years 10 months ago
On the Interpolation Attacks on Block Ciphers
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
Amr M. Youssef, Guang Gong
COMPGEOM
2005
ACM
15 years 8 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...