1677 search results - page 24 / 336 » On the Completeness of Quantum Computation Models |
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
The phenomenon of visual curve completion, where the visual system completes the missing part (e.g., due to occlusion) between two contour fragments, is a major problem in percept...
122
click to vote
CONCUR
2000
Springer
15 years 5 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
132
click to vote
CLOR
2006
15 years 5 months ago
2006
We present a "parts and structure" model for object category recognition that can be learnt efficiently and in a weakly-supervised manner: the model is learnt from examp...
CONCUR
2006
Springer
15 years 5 months ago
2006
Springer
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
132
click to vote
CONCUR
2008
Springer
15 years 3 months ago
2008
Springer
Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the firs...