1816 search results - page 105 / 364 » A New Approach for Solving the Maximum Clique Problem |
132
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
Inhomogeneous Gibbs model (IGM) [4] is an effective maximum entropy model in characterizing complex highdimensional distributions. However, its training process is so slow that th...
183
click to vote
SIAMSC
2011
15 years 1 months ago
2011
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
165
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
143
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper presents a sparse approach of solving the onesided Procrustes problem with special orthogonal constraint. By leveraging a planar decomposition common to all rotation ma...
170
click to vote
ASPDAC
2009
ACM
16 years 17 days ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...