1382 search results - page 8 / 277 » Term ordering problem on MDG |
146
click to vote
AIED
2005
Springer
15 years 12 months ago
2005
Springer
— As an increasing number of robots have been designed to interact with people on a regular basis, research into human-robot interaction has become more widespread. At the same t...
169
click to vote
LICS
2007
IEEE
16 years 22 days ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
162
click to vote
EMMCVPR
2009
Springer
15 years 4 months ago
2009
Springer
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...
321
Voted
EMMCVPR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We follow recent work by Schoenemann et al. [25] for expressing curvature regularity as a linear program. While the original formulation focused on binary segmentation, w...
179
Voted
ATVA
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...