—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Understanding neural connectivity and structures in the brain requires detailed 3D anatomical models, and such an understanding is essential to the study of the nervous system. Ho...
composed of various graphs linked together by relations of abstraction/refinement. The new structure is useful for representing information that can be described at t levels of abs...
The reconstruction of 3D objects from a point-cloud is based on sufficient separation of the points representing objects of interest from the points of other, unwanted objects. Thi...