905 search results - page 136 / 181 » On the Complexity of uSPR Distance |
TALG
2008
14 years 9 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
123
click to vote
JPDC
2007
14 years 9 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
VR
2008
IEEE
14 years 9 months ago
2008
IEEE
We present a new technique for managing visual clutter caused by overlapping labels in complex information displays. This technique, "label layering", utilizes stereosco...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
CVIU
2004
14 years 9 months ago
2004
This paper describes a method to identify partially occluded shapes which are randomly oriented in 3D space. The goal is to match the object contour present in an image with an ob...