588 search results - page 47 / 118 » Reducibility and Completeness in Private Computations |
CVIU
2011
13 years 5 months ago
2011
The medial axis transform is valuable for shape representation as it is complete and captures part structure. However, its exact computation for arbitrary 3D models is not feasibl...
ECCV
2008
Springer
14 years 12 months ago
2008
Springer
We present an algorithm to reduce per-pixel search ranges for Markov Random Fields-based stereo algorithms. Our algorithm is based on the intuitions that reliably matched pixels ne...
IMR
2004
Springer
14 years 3 months ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
ICPP
2007
IEEE
14 years 4 months ago
2007
IEEE
As the number of computing and storage nodes keeps increasing, the interconnection network is becoming a key element of many computing and communication systems, where the overall...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
Reconfigurable computing systems have developed the capability of changing the configuration of the reconfigurable coprocessor multiple times during the course of a program. Howev...