280 search results - page 34 / 56 » New Algorithms for Enumerating All Maximal Cliques |
110
click to vote
TON
2010
14 years 10 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
152
click to vote
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noisefre...
115
click to vote
COMPSEC
2010
14 years 12 months ago
2010
Model checking security protocols is based on an intruder model that represents the eavesdropping or interception of the exchanged messages, while at the same time performs attack...
SIAMCOMP
2000
14 years 11 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
102
click to vote
CBMS
2005
IEEE
15 years 5 months ago
2005
IEEE
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest...