588 search results - page 47 / 118 » Reducibility and Completeness in Private Computations |
209
click to vote
CVIU
2011
15 years 1 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...
160
click to vote
ECCV
2008
Springer
16 years 8 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...
135
click to vote
IMR
2004
Springer
15 years 11 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...
171
click to vote
ICPP
2007
IEEE
16 years 13 days 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...
124
click to vote
IPPS
2007
IEEE
16 years 13 days 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...