8512 search results - page 168 / 1703 » Computing Theory With Relevance |
152
click to vote
ICCV
1995
IEEE
15 years 8 months ago
1995
IEEE
Computational vision algorithms are often developed in a Bayesian framework. Two estimators are commonly used: maximum a posteriori (MAP), and minimum mean squared error (MMSE). W...
153
click to vote
APN
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
113
click to vote
EOR
2010
15 years 4 months ago
2010
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...
177
click to vote
IJAR
2006
15 years 4 months ago
2006
In spatial reasoning, in particular for applications in image understanding, structure recognition and computer vision, a lot of attention has to be paid to spatial relationships ...
140
click to vote
TLCA
2007
Springer
15 years 10 months ago
2007
Springer
Inspired by recent work on normalisation by evaluation for sums, we propose a normalising and confluent extensional rewriting theory for the simply-typed λ-calculus extended with...