12825 search results - page 397 / 2565 » Improved PLSOM algorithm |
181
click to vote
AAAI
2006
15 years 8 months ago
2006
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
179
click to vote
JCST
2007
15 years 7 months ago
2007
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that ...
224
click to vote
ADC
2008
Springer
16 years 1 months ago
2008
Springer
In this paper, we study the problem of measuring structural similarities of large number of source schemas against a single domain schema, which is useful for enhancing the qualit...
209
Voted
ECAI
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...
200
click to vote
IFIP12
2007
15 years 9 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...