1257 search results - page 42 / 252 » A generalization of Euler's constant |
SIGGRAPH
1996
ACM
14 years 29 days 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...
AAAI
2012
11 years 11 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
CRYPTO
2012
Springer
11 years 11 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
SPAA
2004
ACM
14 years 2 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
DCG
2006
13 years 8 months ago
2006
Abstract. Hyperbolic area is characterized as the unique continuous isometry invariant simple valuation on convex polygons in H2 . We then show that continuous isometry invariant s...