Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
Run No. Run ID Run Description infMAP (%) training on TV08 data 1 IUPR-TV-M SIFT visual words with maximum entropy 6.1 2 IUPR-TV-MF SIFT with maximum entropy, fused with color+tex...
Adrian Ulges, Christian Schulze, Markus Koch, Thom...
A wide variety of techniques for visual navigation using robot-mounted cameras have been described over the past several decades, yet adoption of optical flow navigation technique...
Jason Campbell, Rahul Sukthankar, Illah R. Nourbak...
We present a comprehensive methodology for realistically animating liquid phenomena. Our approach unifies existing computer graphics techniques for simulating fluids and extends t...