Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
We introduce a simple approach to segment in homogeneous phases a long-duration record of locomotion data consisting of body segment acceleration and foot pressure information onl...
Maud Pasquier, Bernard Espiau, Christine Azevedo-C...
We investigate the use of two-level nested grids as acceleration structure for ray tracing of dynamic scenes. We propose a massively parallel, sort-based construction algorithm an...
Javor Kalojanov, Markus Billeter, Philipp Slusalle...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric on n p...
—This paper presents some preliminary experimental results on RegionBoost, which is a typical example of a class of Boosting algorithms based on dynamic weighting schemes. It is ...