Sciweavers

2714 search results - page 302 / 543
» Approximation Schemes for Scheduling
Sort
View
ICALP
2005
Springer
15 years 9 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
CAD
2005
Springer
15 years 3 months ago
Surface interpolation of meshes by geometric subdivision
Subdivision surfaces are generated by repeated approximation or interpolation from initial control meshes. In this paper, two new nonlinear subdivision schemes, face based subdivi...
Xunnian Yang
IACR
2011
212views more  IACR 2011»
14 years 3 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...
ICALP
2011
Springer
14 years 7 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
INFOCOM
2008
IEEE
15 years 10 months ago
Cross-Monotonic Multicast
—In the routing and cost sharing of multicast towards a group of potential receivers, cross-monotonicity is a property that states a user’s payment can only be smaller when ser...
Zongpeng Li