107 search results - page 18 / 22 » Approximating Fair Use in LicenseScript |
CAGD
2005
13 years 7 months ago
2005
In this paper, we propose a sharpness dependent filter design based on the fairing of surface normal, whereby the filtering algorithm automatically selects a filter. This may be a...
CORR
2007
Springer
13 years 7 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 × ...
WADS
1997
Springer
13 years 11 months ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...