Sciweavers

7129 search results - page 700 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ECCC
2008
98views more  ECCC 2008»
15 years 7 months ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert
AICOM
2006
124views more  AICOM 2006»
15 years 7 months ago
A Compact Representation for Least Common Subsumers in the description logic ALE
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousse...
EOR
2006
103views more  EOR 2006»
15 years 7 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
INFORMS
2008
241views more  INFORMS 2008»
15 years 7 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
JDA
2008
101views more  JDA 2008»
15 years 7 months ago
Student-Project Allocation with preferences over Projects
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David Manlove, Gregg O'Malley