19798 search results - page 552 / 3960 » Is Structural Subtyping Useful |
134
click to vote
HPCN
1997
Springer
15 years 8 months ago
1997
Springer
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
166
click to vote
APCCM
2004
15 years 6 months ago
2004
Despite the hype surrounding enterprise architectures, they have delivered little on their promise. In this paper, we argue that enterprise architectures built using component-bas...
127
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we suggest to use a steepest descent algorithm for learning a parametric dictionary in which the structure or atom functions are known in advance. The structure of ...
151
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation deve...
160
click to vote
DATESO
2009
15 years 2 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....