524 search results - page 53 / 105 » Context Trees |
CORR
2000
Springer
15 years 16 days ago
2000
Springer
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
91
Voted
VRST
1997
ACM
15 years 4 months ago
1997
ACM
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...
203
click to vote
ICDE
2007
IEEE
16 years 2 months ago
2007
IEEE
Abstract breaches. To do so, the data custodian needs to transform its data. To determine the appropriate transforPrivacy preserving data mining so far has mainly mation, there are...
115
click to vote
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
113
Voted
ICDM
2002
IEEE
15 years 5 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...