2370 search results - page 48 / 474 » The Characterization of Data-Accumulating Algorithms |
MLQ
1998
14 years 9 months ago
1998
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
102
click to vote
JGAA
2007
14 years 9 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
ENTCS
2007
14 years 9 months ago
2007
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way f...
102
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
TSP
2012
13 years 5 months ago
2012
—Modeling natural and artificial systems has played a key role in various applications and has long been a task that has drawn enormous efforts. In this work, instead of explori...