Sciweavers

108 search results - page 17 / 22
» mor 2006
Sort
View
CORR
2006
Springer
84views Education» more  CORR 2006»
13 years 9 months ago
A simple generalization of El-Gamal cryptosystem to non-abelian groups
In this paper we propose the group of unitriangular matrices over a finite field as a non-abelian group and composition of inner, diagonal and central automorphisms as a group of a...
Ayan Mahalanobis
MOR
2002
102views more  MOR 2002»
13 years 9 months ago
Facets of the Complementarity Knapsack Polytope
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
Ismael R. de Farias Jr., Ellis L. Johnson, George ...
MOR
2007
149views more  MOR 2007»
13 years 9 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
MOR
2007
100views more  MOR 2007»
13 years 9 months ago
On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
A deterministic server is shared by users with identical linear waiting costs, requesting jobs of arbitrary lengths. Shortest jobs are served first for efficiency. The server can...
Hervé Moulin
MOR
2010
108views more  MOR 2010»
13 years 8 months ago
Accuracy Certificates for Computational Problems with Convex Structure
The goal of the current paper is to introduce the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems inc...
Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum