Sciweavers

3954 search results - page 128 / 791
» Image-based Model Completion
Sort
View
119
Voted
ICCV
2007
IEEE
16 years 7 months ago
Correspondence labelling for wide-timeframe free-form surface matching
This paper addresses the problem of estimating dense correspondence between arbitrary frames from captured sequences of shape and appearance for surfaces undergoing free-form defo...
Jonathan Starck, Adrian Hilton
DDECS
2009
IEEE
202views Hardware» more  DDECS 2009»
15 years 12 months ago
Asynchronous two-level logic of reduced cost
— We propose a novel synthesis method of a dual-rail asynchronous two-level logic of reduced cost. It is based on a model that operates under so called modified weak constraints....
Igor Lemberski, Petr Fiser
119
Voted
ICTAI
2005
IEEE
15 years 10 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet
RTA
2005
Springer
15 years 10 months ago
Universal Algebra for Termination of Higher-Order Rewriting
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
Makoto Hamana
147
Voted
CONCUR
2004
Springer
15 years 10 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König