588 search results - page 76 / 118 » Reducibility and Completeness in Private Computations |
151
click to vote
IJON
2008
15 years 6 months ago
2008
In many computer vision tasks like face recognition and image retrieval, one is often confronted with high-dimensional data. Procedures that are analytically or computationally ma...
156
click to vote
CGF
2007
15 years 6 months ago
2007
This paper presents a novel method for real-time homogenous translucent material editing under fixed illumination. We consider the complete analytic BSSRDF model proposed by Jens...
167
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
140
click to vote
MP
2010
15 years 4 months ago
2010
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
172
click to vote
BMVC
2010
15 years 4 months ago
2010
Kernel methods yield state-of-the-art performance in certain applications such as image classification and object detection. However, large scale problems require machine learning...