In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
As device geometries continue to shrink, single event upsets are becoming of concern to a wider spectrum of system designers. These “soft errors” can be a nuisance or catastro...
Abstract. We introduce mathematically rigorous metrics on agent experiences having various temporal horizons. Sensorimotor variables accessible to the agent are treated as informat...
Chrystopher L. Nehaniv, Naeem Assif Mirza, Kerstin...
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Global illumination dramatically improves realistic appearance of rendered scenes, but usually it is neglected in VR systems due to its high costs. In this work we present an effi...
Kirill Dmitriev, Thomas Annen, Grzegorz Krawczyk, ...