2233 search results - page 223 / 447 » On the Complexity of Theory Curbing |
177
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
151
click to vote
ICCD
2005
IEEE
16 years 3 months ago
2005
IEEE
In this paper we present algorithmic and architectural methodology for building Particle Filters in hardware. Particle filtering is a new paradigm for filtering in presence of n...
214
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...
168
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...
148
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 ...