1279 search results - page 147 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
178
click to vote
CANS
2011
Springer
14 years 1 months ago
2011
Springer
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
101
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
109
click to vote
AAIM
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...
121
click to vote
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
116
click to vote
SPAA
2006
ACM
15 years 7 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...