Sciweavers

1816 search results - page 87 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
AAAI
2011
14 years 6 months ago
A Feasible Nonconvex Relaxation Approach to Feature Selection
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
Cuixia Gao, Naiyan Wang, Qi Yu, Zhihua Zhang
JCP
2006
83views more  JCP 2006»
15 years 6 months ago
Concurrent Failures and Redundant Protection Problem in Hierarchical GMPLS Networks
The generalized multiprotocol label switching (GMPLS) networks attain a hierarchical structure, and each layer maintains an independent protection mechanism, resulting in redundant...
Sung-eok Jeon
ICPR
2008
IEEE
16 years 7 months ago
Rapid signer adaptation for continuous sign language recognition using a combined approach of eigenvoices, MLLR, and MAP
Current sign language recognition systems are still designed for signer-dependent operation only and thus suffer from the problem of interpersonal variability in production. Appli...
Christoph Blömer, Karl-Friedrich Kraiss, Ulri...
ECCV
2008
Springer
16 years 7 months ago
Automatic Generator of Minimal Problem Solvers
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...
Martin Bujnak, Tomás Pajdla, Zuzana Kukelov...
CVPR
2008
IEEE
16 years 14 days ago
A linear approach to motion estimation using generalized camera models
A well-known theoretical result for motion estimation using the generalized camera model is that 17 corresponding image rays can be used to solve linearly for the motion of a gene...
Hongdong Li, Richard I. Hartley, Jae-Hak Kim