Sciweavers

85 search results - page 12 / 17
» Open Bisimulation, Revisited
Sort
View
AI
2010
Springer
14 years 10 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
EUROCRYPT
2004
Springer
15 years 3 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
CONCUR
2007
Springer
15 years 4 months ago
Is Observational Congruence Axiomatisable in Equational Horn Logic?
It is well known that bisimulation on µ-expressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom/´Esik necessar...
Michael Mendler, Gerald Lüttgen
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
15 years 4 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
ICMCS
2006
IEEE
124views Multimedia» more  ICMCS 2006»
15 years 4 months ago
On the Potential of Incorporating Knowledge of Human Visual Attention into Cbir Systems
Content-based image retrieval (CBIR) systems have been actively investigated over the past decade. Several existing CBIR prototypes claim to be designed based on perceptual charac...
Oge Marques, Liam M. Mayron, Gustavo B. Borba, Hum...