( en | de | ru )

 

Disambiguation of "Seese, Detlef"

Author of the publication

copydeleteadd this publication to your clipboard
Towards a Benchmarking Framework for Financial Text Mining.

, , , and . Information Management and Market Engineering Vol. II, volume 12 of Studies on eOrganisation and Market Engineering, KIT Scientific Publishing, (2011)

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.

Detlef Seese

Anita Seese

Alfred Seese

Bernd Seese

Gertrud Seeser

 

Other publications of authors with the same name

Executable product models - The intelligent way., and . SMC, page 1987-1992. IEEE, (2007)The Structure of Models of Decidable Monadic Theories of Graphs.. Ann. Pure Appl. Log., 53 (2): 169-195 (1991)An Algebraic Theory of Graph Reduction., , , and . Graph-Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, page 70-83. Springer, (1990)A Conceptual Framework for the Governance of Service-Oriented Architectures., and . ICSOC Workshops, volume 5472 of Lecture Notes in Computer Science, page 327-338. Springer, (2008)Risk-Return Analysis with an Integrated Perspective on Market, Credit and Operational Risk, , and . 10th Symposium on Finance, Banking, and Insurance, Book of Abstracts p. 52, (December 2005)Universität Karlsruhe (TH).Towards Validating Prediction Systems for Process Understandability: Measuring Process Understandability., and . SYNASC, page 564-571. IEEE Computer Society, (2008)Visualization and Clustering of Business Process Collections Based on Process Metric Values., and . SYNASC, page 572-575. IEEE Computer Society, (2008)Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures.. FCT, volume 117 of Lecture Notes in Computer Science, page 341-349. Springer, (1981)Interpretability and tree automata: A simple way to solve algorithmic problems on graphs closely related to trees.. Tree Automata and Languages, North-Holland, (1992)Trees, grids, and MSO decidability: From graphs to matroids., and . Theor. Comput. Sci., 351 (3): 372-393 (2006)