1254 search results - page 21 / 251 » Making Hard Problems Harder |
IWSEC
2007
Springer
14 years 1 months ago
2007
Springer
The problem of defending software against tampering by a malicious host is not expected to be solved soon. Rather than trying to defend against the first attack, randomization tri...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this g...
IWANN
2005
Springer
14 years 1 months ago
2005
Springer
Boosting constructs a weighted classifier out of possibly weak learners by successively concentrating on those patterns harder to classify. While giving excellent results in many ...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
ASUNAM
2011
IEEE
12 years 7 months ago
2011
IEEE
Abstract—Community detection or cluster detection in networks is a well-studied, albeit hard, problem. Given the scale and complexity of modern day social networks, detecting “...