Sciweavers

923 search results - page 130 / 185
» On a generalization of Stickelberger's Theorem
Sort
View
FOCS
2003
IEEE
15 years 5 months ago
Towards a Characterization of Truthful Combinatorial Auctions
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...
Ron Lavi, Ahuva Mu'alem, Noam Nisan
CONTEXT
2003
Springer
15 years 5 months ago
On the Difference between Bridge Rules and Lifting Axioms
Abstract. In a previous paper, we proposed a first formal and conceptual comparison between the two most important formalizations of context in AI: Propositional Logic of Context ...
Paolo Bouquet, Luciano Serafini
IPSN
2003
Springer
15 years 5 months ago
Source-Channel Communication in Sensor Networks
Sensors acquire data, and communicate this to an interested party. The arising coding problem is often split into two parts: First, the sensors compress their respective acquired s...
Michael Gastpar, Martin Vetterli
EUROCRYPT
2010
Springer
15 years 4 months ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
COCO
2001
Springer
122views Algorithms» more  COCO 2001»
15 years 4 months ago
Hausdorff Dimension in Exponential Time
In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in line...
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, F...