Sciweavers

93 search results - page 8 / 19
» On representations of the feasible set in convex optimizatio...
Sort
View
PAMI
2012
11 years 10 months ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
13 years 9 months ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
AUTOMATICA
2008
98views more  AUTOMATICA 2008»
13 years 8 months ago
An algorithm for bounded-error identification of nonlinear systems based on DC functions
This paper presents a guaranteed method for the parameter estimation of nonlinear models in a bounded-error context. This method is based on functions which consists of the differ...
J. M. Bravo, T. Alamo, M. J. Redondo, Eduardo F. C...
ISPD
1998
ACM
107views Hardware» more  ISPD 1998»
14 years 2 days ago
Sequence-pair based placement method for hard/soft/pre-placed modules
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
Hiroshi Murata, Ernest S. Kuh