Sciweavers

425 search results - page 51 / 85
» Polynomial Factorization 1987-1991
Sort
View
COCOON
2005
Springer
14 years 3 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
CP
2005
Springer
14 years 3 months ago
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
Roie Zivan, Amnon Meisels
INDOCRYPT
2005
Springer
14 years 3 months ago
MaTRU: A New NTRU-Based Cryptosystem
Abstract. In this paper, we propose a new variant of the NTRU public key cryptosystem − the MaTRU cryptosystem. MaTRU works under the same general principles as the NTRU cryptosy...
Michael Coglianese, Bok-Min Goi
WINE
2005
Springer
182views Economy» more  WINE 2005»
14 years 3 months ago
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
Subhash Khot, Richard J. Lipton, Evangelos Markaki...
ICALP
2004
Springer
14 years 3 months ago
A Note on Karr's Algorithm
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
Markus Müller-Olm, Helmut Seidl