13603 search results - page 361 / 2721 » On the Computational Complexity of Cut-Reduction |
190
click to vote
ACIVS
2006
Springer
16 years 1 months ago
2006
Springer
A new general framework for shape extraction is presented, based on the paradigm of water flow. The mechanism embodies the fluidity of water and hence can detect complex shapes. A ...
188
click to vote
ECCV
2010
Springer
16 years 27 days ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
196
click to vote
SPAA
2003
ACM
16 years 24 days ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
191
click to vote
ICCSA
2003
Springer
16 years 23 days ago
2003
Springer
In this paper, we model an agent-based economy in which heterogeneous agents (firms and a bank) interact in the financial markets. The heterogeneity is due to the balance sheet ...
196
click to vote
STACS
2001
Springer
15 years 12 months ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...