We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
We present a novel boundary handling scheme for incompressible fluids based on Smoothed Particle Hydrodynamics (SPH). In combination with the predictive-corrective incompressible ...
Markus Ihmsen, Nadir Akinci, Marc Gissler, Matthia...
We present the results of gravitational direct N-body simulations using the commercial graphics processing units (GPU) NVIDIA Quadro FX1400 and GeForce 8800GTX, and compare the re...
Simon Portegies Zwart, Robert G. Belleman, Peter G...
Abstract. We present experimental results about learning function values (i.e. Bellman values) in stochastic dynamic programming (SDP). All results come from openDP (opendp.sourcef...
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Analog simulators typically use a dynamic, adaptive time step control strategy in order to minimize the calculations performed during inactive portions of a system’s operation, ...
This paper presents a set of feature enhancement techniques coupled with hardware-accelerated nonphotorealistic rendering for generating more perceptually effective visualizations...
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
- Stable and effective enforcement of hard constraints is one of the crucial components in controlling physics-based dynamic simulation systems. The conventional explicit Baumgarte...
Min Hong, Min-Hyung Choi, Sunhwa Jung, Samuel W. J...
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
Jinzhu Gao, Han-Wei Shen, Jian Huang, James Arthur...