15792 search results - page 246 / 3159 » Computational Abstraction Steps |
168
click to vote
JLP
2010
15 years 2 months ago
2010
Abstract. Noting that the usual `propositionally' based way of composing retrenchments can yield many `junk' cases, alternative approaches to composition are introduced (...
164
click to vote
PPL
2010
15 years 5 months ago
2010
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
209
click to vote
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
214
click to vote
JFP
2000
15 years 7 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
216
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
In this paper, we present a compositional boosting algorithm for detecting and recognizing 17 common image structures in low-middle level vision tasks. These structures, called &q...