From post

Improving Query Evaluation with Approximate Functional Dependency Based Decompositions.

, , , и . BNCOD, том 2405 из Lecture Notes in Computer Science, стр. 26-41. Springer, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Microcode Bit Optimizations is N P-Complete.. IEEE Trans. Computers, 28 (4): 316-319 (1979)That really is a hard problem you've spent six months working on: A tutorial on NP-complete problems., и . ACM Annual Conference, стр. 293-294. ACM, (1981)A note on approximation measures for multi-valued dependencies in relational databases., и . Inf. Process. Lett., 85 (3): 153-158 (2003)On approximation measures for functional dependencies., и . Inf. Syst., 29 (6): 483-507 (2004)On the Structure of Sets in NP and Other Complexity Classes., , и . Theor. Comput. Sci., (1981)On the Sequential Nature of Functions., , и . J. Comput. Syst. Sci., 13 (1): 51-68 (1976)CE: the Classifier-Estimator Framework for Data Mining., , и . DS-7, том 124 из IFIP Conference Proceedings, стр. 89-104. Chapman & Hall, (1997)Nonlinear Magnification Fields., и . INFOVIS, стр. 51-58. IEEE Computer Society, (1997)Techniques for non-linear magnification transformations., и . INFOVIS, стр. 38-45. IEEE, (1996)An Entropy-based Approach to Visualizing Database Structure., и . VDB, том 216 из IFIP Conference Proceedings, стр. 157-170. Kluwer, (2002)