A “graphics for vision” approach is proposed to address the problem of reconstruction from a large and imperfect data set: reconstruction on demand by tensor voting, or ROD-TV...
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...