Sciweavers

476 search results - page 45 / 96
» The Complexity of Equality Constraint Languages
Sort
View
ENTCS
2006
103views more  ENTCS 2006»
13 years 9 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
CVPR
2009
IEEE
15 years 4 months ago
Reconstructing Sharply Folding Surfaces: A Convex Formulation
In recent years, 3D deformable surface reconstruction from single images has attracted renewed interest. It has been shown that preventing the surface from either shrinking or s...
Mathieu Salzmann (University of California, Berkel...
ICML
2008
IEEE
14 years 9 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
INFOCOM
2008
IEEE
14 years 3 months ago
End-to-End Resource Allocation in OFDM Based Linear Multi-Hop Networks
— We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple re...
Xiaolu Zhang, Wenhua Jiao, Meixia Tao
CSCLP
2007
Springer
14 years 3 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth