Sciweavers

588 search results - page 76 / 118
» Reducibility and Completeness in Private Computations
Sort
View
IJON
2008
121views more  IJON 2008»
13 years 10 months ago
Locality sensitive semi-supervised feature selection
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...
Jidong Zhao, Ke Lu, Xiaofei He
CGF
2007
113views more  CGF 2007»
13 years 10 months ago
Real-time homogenous translucent material editing
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...
Kun Xu, Yue Gao, Yong Li, Tao Ju, Shi-Min Hu
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 10 months ago
Matroid Pathwidth and Code Trellis Complexity
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 ...
Navin Kashyap
MP
2010
135views more  MP 2010»
13 years 8 months ago
An inexact Newton method for nonconvex equality constrained optimization
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...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
BMVC
2010
13 years 8 months ago
Generalized RBF feature maps for Efficient Detection
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...
Sreekanth Vempati, Andrea Vedaldi, Andrew Zisserma...