In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Seeded image segmentation is a popular type of supervised image segmentation in computer vision and image processing. Previous methods of seeded image segmentation treat the image...