855 search results - page 75 / 171 » Complexity of Equations over Sets of Natural Numbers |
SIROCCO
1998
14 years 11 months ago
1998
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
VISUALIZATION
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper introduces a method for smoothing complex, noisy surfaces, while preserving (and enhancing) sharp, geometric features. It has two main advantages over previous approach...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. We present a technique for learning the parameters of a continuousstate Markov random field (MRF) model of optical flow, by minimizing the training loss for a set of grou...
LICS
1991
IEEE
15 years 1 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
CSL
2010
Springer
14 years 11 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...