207 search results - page 19 / 42 » Canonical Forms for Data-Specifications |
SIGMOD
1998
ACM
15 years 2 months ago
1998
ACM
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
LICS
1997
IEEE
15 years 1 months ago
1997
IEEE
We present a categorical theory of ‘well-behaved’ operational semantics which aims at complementing the established theory of domains and denotational semantics to form a cohe...
122
click to vote
GLVLSI
1996
IEEE
15 years 1 months ago
1996
IEEE
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
LICS
1990
IEEE
15 years 1 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
ATVA
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...