Sciweavers

25041 search results - page 4231 / 5009
» Algorithms for Clustering Data
Sort
View
APWEB
2006
Springer
15 years 11 months ago
Efficient Mining Strategy for Frequent Serial Episodes in Temporal Database
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...
Kuo-Yu Huang, Chia-Hui Chang
APWEB
2006
Springer
15 years 11 months ago
An Effective System for Mining Web Log
The WWW provides a simple yet effective media for users to search, browse, and retrieve information in the Web. Web log mining is a promising tool to study user behaviors, which co...
Zhenglu Yang, Yitong Wang, Masaru Kitsuregawa
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
15 years 11 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 11 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
ECAI
2004
Springer
15 years 11 months ago
Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
Yoshitaka Kameya, Taisuke Sato, Neng-Fa Zhou
« Prev « First page 4231 / 5009 Last » Next »