6575 search results - page 137 / 1315 » Specializing visualization algorithms |
210
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
160
click to vote
WEA
2009
Springer
16 years 1 months ago
2009
Springer
We propose new practical algorithms to find degree-relaxed variants of cliques called s-plexes. An s-plex denotes a vertex subset in a graph inducing a subgraph where every vertex...
177
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
We propose a new optimization algorithm called Generalized Baum Welch (GBW) algorithm for discriminative training on hidden Markov model (HMM). GBW is based on Lagrange relaxation...
163
click to vote
ICIP
2008
IEEE
16 years 24 days ago
2008
IEEE
In several imaging inverse problems, it may be of interest to encourage the solution to have characteristics which are most naturally expressed by the combination of more than one...
142
click to vote
ICMCS
2006
IEEE
16 years 12 days ago
2006
IEEE
In order to improve the robustness and imperceptibleness of the image spread spectrum watermark algorithm, a new approach for optimization in 8×8 DCT domain using genetic algorit...