Sciweavers

5084 search results - page 620 / 1017
» Proving Possibility Properties
Sort
View
TALG
2008
93views more  TALG 2008»
15 years 6 months ago
Limitations of cross-monotonic cost-sharing schemes
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
TCS
2008
15 years 6 months ago
On strong normalization and type inference in the intersection type discipline
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
Gérard Boudol
TCS
2008
15 years 6 months ago
Security types for dynamic web data
We describe a type system for the Xd calculus of Gardner and Maffeis. An Xd-network is a network of locations, where each location consists of both a data tree (which contains scr...
Mariangiola Dezani-Ciancaglini, Silvia Ghilezan, J...
TCS
2008
15 years 6 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
TIT
2008
147views more  TIT 2008»
15 years 6 months ago
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...