1650 search results - page 248 / 330 » The HOM problem is decidable |
211
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
174
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
148
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
160
click to vote
EVOW
2005
Springer
15 years 12 months ago
2005
Springer
This work presents an evolutionary approach to improve the infection algorithm to solve the problem of dense stereo matching. Dense stereo matching is used for 3D reconstruction in...
185
click to vote
FSTTCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Message sequence charts (MSCs) are commonly used to specify interactions between agents in communicating systems. Their visual nature makes them attractive for describing...