2219 search results - page 420 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
140
click to vote
COCO
1994
Springer
15 years 6 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
136
click to vote
IFM
2010
Springer
15 years 12 days ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
135
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
112
click to vote
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
105
click to vote
CIVR
2007
Springer
15 years 8 months ago
2007
Springer
Automatic image annotation automatically labels image content with semantic keywords. For instance, the Relevance Model estimates the joint probability of the keyword and the imag...