We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
— Circuit and processor designs will continue to increase in complexity for the foreseeable future. With these increasing sizes comes the use of wide buses to move large amounts ...
Most studies of plans and situated work have applied ethnographic methods and and thus fail to provide any quantitative insight into the extent of this phenomenon. We present a st...
Time-varying spatial patterns are common, but few computational tools exist for discovering and tracking multiple, sometimes overlapping, spatial structures of targets. We propose...