4218 search results - page 27 / 844 » Complete sets of cooperations |
JAPLL
2010
13 years 6 months ago
2010
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...
JCO
2007
13 years 7 months ago
2007
Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this c...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
CRYPTO
2001
Springer
14 years 3 days ago
2001
Springer
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...