1226 search results - page 206 / 246 » Proofs, Programs and Abstract Complexity |
ESORICS
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Cryptographic protocols are useful for engineering trust in transactions. There are several languages for describing these protocols, but these tend to capture the commun...
141
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
115
click to vote
CP
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. This article presents a novel method for acquiring high-quality solid models of complex 3D shapes from multiple calibrated photographs. After the purely geometric constra...
IDA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...