4099 search results - page 459 / 820 » First Class Patterns |
173
Voted
ENTCS
2008
15 years 6 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
187
click to vote
IAJIT
2008
15 years 6 months ago
2008
: UML currently still lacks a rigorously defined semantics for its models, which makes formally analyzing a model and verifying its properties extremely difficult. To remedy that, ...
156
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Consider a hidden Markov chain obtained as the observation process of an ordinary Markov chain corrupted by noise. Zuk, et. al. [13, 14] showed how, in principle, one can explicit...
177
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
184
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...