Sciweavers

16430 search results - page 869 / 3286
» On Computable Tree Functions
Sort
View
CGF
2011
14 years 11 months ago
RTSAH Traversal Order for Occlusion Rays
We accelerate the finding of occluders in tree based acceleration structures, such as a packetized BVH and a single ray kd-tree, by deriving the ray termination surface area heur...
Thiago Ize, Charles D. Hansen
DISOPT
2011
201views Education» more  DISOPT 2011»
14 years 11 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
EUROCAST
1997
Springer
85views Hardware» more  EUROCAST 1997»
15 years 11 months ago
Turing Universality of Neural Nets (Revisited)
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. W...
João Pedro Guerreiro Neto, Hava T. Siegelma...
SAC
2008
ACM
15 years 7 months ago
Evaluation of Tweedie exponential dispersion model densities by Fourier inversion
The Tweedie family of distributions is a family of exponential dispersion models with power variance functions V (
Peter K. Dunn, Gordon K. Smyth
FOCS
2010
IEEE
15 years 5 months ago
Minimum-Cost Network Design with (Dis)economies of Scale
Given a network, a set of demands and a cost function f(
Matthew Andrews, Spyridon Antonakopoulos, Lisa Zha...