Sciweavers

14165 search results - page 89 / 2833
» The generalized two-server problem
Sort
View
IJNSEC
2008
103views more  IJNSEC 2008»
15 years 3 months ago
General Group Oriented ID-based Cryptosystems with Chosen Plaintext Security
A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the cipher...
Chunxiang Xu, Junhui Zhou, Guozhen Xiao
106
Voted
AAIM
2007
Springer
116views Algorithms» more  AAIM 2007»
15 years 9 months ago
Solving Generalized Maximum Dispersion with Linear Programming
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
Gerold Jäger, Anand Srivastav, Katja Wolf
JGO
2008
95views more  JGO 2008»
15 years 3 months ago
Generalized Semi-Infinite Programming: on generic local minimizers
Abstract In this paper a basic structural problem in Generalized Semi-Infinite Programming is solved. In fact, under natural and generic assumptions we show that at any (local) min...
Harald Günzel, Hubertus Th. Jongen, Oliver St...
92
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
A Non-Commutative Generalization of ElGamal Key Exchange using Polycyclic Groups
Abstract— In this paper, we propose a non-commutative keyexchange scheme which generalizes the classical ElGamal Cipher to polycyclic groups. We will explore other classes of gro...
Delaram Kahrobaei, Bilal Khan
134
Voted
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 9 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang