Author of the publication

Fun at a Department Store: Data Mining Meets Switching Theory.

, , , and . FUN, volume 6099 of Lecture Notes in Computer Science, page 41-52. Springer, (2010)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Variations on a Method for Representing Data Items of Unlimited Length.. IEEE Trans. Software Eng., 11 (4): 439-441 (1985)A note on visibility graphs., , and . Discret. Math., 64 (2-3): 209-219 (1987)Access to rows and columns of a rectangular array in a concentricloop bubble memory.. Integr., 3 (4): 347-354 (1985)Routing with the use of masks., , , and . SIROCCO, page 188-200. Carleton Scientific, (1998)Decomposition of k-Dense Trees., , , and . WDAS, volume 9 of Proceedings in Informatics, page 11-23. Carleton Scientific, (2000)Comment on Generalized AVL Trees., and . Commun. ACM, 23 (7): 394-395 (1980)A Tree Storage Scheme for Magnetic Bubble Memories., , and . IEEE Trans. Computers, 29 (10): 864-874 (1980)Extending the Definition of Prime Compatibility Classes of States in Incomplete Sequential Machine Reduction.. IEEE Trans. Computers, 18 (6): 537-540 (1969)Fun at a Department Store: Data Mining Meets Switching Theory., , , and . FUN, volume 6099 of Lecture Notes in Computer Science, page 41-52. Springer, (2010)A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks., and . IEEE Trans. Electronic Computers, 14 (3): 350-359 (1965)