2479 search results - page 265 / 496 » Quantum complexity theory |
215
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
We introduce a novel data-driven mean-shift belief propagation
(DDMSBP) method for non-Gaussian MRFs, which
often arise in computer vision applications. With the aid
of scale sp...
177
click to vote
WOSP
2010
ACM
16 years 1 months ago
2010
ACM
In this paper we provide a general method to derive productform solutions for stochastic models. We take inspiration from the Reversed Compound Agent Theorem [14] and we provide a...
150
click to vote
LATA
2010
Springer
16 years 1 months ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
165
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
166
click to vote
QSIC
2009
IEEE
16 years 1 months ago
2009
IEEE
—A well-founded testing theory encourages the practical application of test case generation techniques. This aims at overcoming the ever increasing complexity of softwareenabled ...