2200 search results - page 71 / 440 » Bloch's Constant is Computable |
309
click to vote
SIGGRAPH
1996
ACM
15 years 11 months ago
1996
ACM
A classical problem of imaging--the matting problem--is separation of a non-rectangular foreground image from a (usually) rectangular background image--for example, in a film fram...
214
click to vote
COMGEO
2012
ACM
14 years 2 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
227
click to vote
COMGEO
2002
ACM
15 years 6 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
225
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The integration of reasoning and computation services across system and language boundaries has been mostly treated from an engineering perspective. In this paper we take a foundat...
222
click to vote
EUROCRYPT
2011
Springer
14 years 10 months ago
2011
Springer
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...