2899 search results - page 201 / 580 » Dynamic Trees in Practice |
146
click to vote
ICDM
2002
IEEE
15 years 9 months ago
2002
IEEE
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
142
click to vote
PG
2002
IEEE
15 years 9 months ago
2002
IEEE
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...
119
click to vote
SAS
1999
Springer
15 years 9 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
137
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
169
click to vote
EDOC
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract-- Analysis of workflows in terms of structural correctness is important for ensuring the quality of workflow models. Typically, this analysis is only one step in a larger ...