In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
Mark de Berg, Matthew J. Katz, A. Frank van der St...
Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in c...
Sudarshan S. Chawathe, Anand Rajaraman, Hector Gar...
The transition to multithreaded, multi-core designs places a greater responsibility on programmers and software for improving performance; thread-level parallelism (TLP) will be i...
Tipp Moseley, Daniel A. Connors, Dirk Grunwald, Ra...
The paper presents a framework for semi-supervised nonlinear embedding methods useful for exploratory analysis and visualization of spatio-temporal network data. The method provid...