Sciweavers

3038 search results - page 130 / 608
» High-Speed Function Approximation
Sort
View
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
15 years 10 months ago
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 9 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
143
Voted
CEC
2007
IEEE
15 years 6 months ago
Multi-population approach to approximate the development of neocortical networks
— Cultured natural cortical neurons form functional networks through a complex set of developmental steps during the first weeks in vitro. The dynamic behavior of the network in...
Andreas Herzog, Karsten Kube, Bernd Michaelis, Ana...
SAC
2009
ACM
15 years 11 months ago
GPU-based computation of distance functions on road networks with applications
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...
Marta Fort, Joan Antoni Sellarès
HYBRID
2009
Springer
15 years 11 months ago
Optimal Boundary Control of Convention-Reaction Transport Systems with Binary Control Functions
We investigate a new approach for solving boundary control problems for dynamical systems that are governed by transport equations, when the control function is restricted to binar...
Falk M. Hante, Günter Leugering