1816 search results - page 84 / 364 » A New Approach for Solving the Maximum Clique Problem |
156
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
177
click to vote
ICANN
2005
Springer
15 years 11 months ago
2005
Springer
Although Support Vector Machines (SVMs) have been successfully applied to solve a large number of classification and regression problems, they suffer from the catastrophic forgetti...
228
click to vote
PET
2012
Springer
13 years 8 months ago
2012
Springer
It is widely accepted that Disclosure Attacks are effective against high-latency anonymous communication systems. A number of Disclosure Attack variants can be found in the litera...
163
click to vote
IJON
2007
15 years 5 months ago
2007
The blind source separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical independence between outputs. Since global maximization may...
211
click to vote
AAAI
2008
15 years 8 months ago
2008
Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target...