This paper presents results from twenty-one semi-structured interviews with museum information professionals (MIPs) who were asked about their experiences working with information...
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
Copyright 2001 IEEE. Published in the 2001 International Conference on Image Processing (ICIP-2001), October 7-10, 2001, Thessaloniki, Greece. Personal use of this material is per...
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...