9818 search results - page 1877 / 1964 » Much Support and More |
205
click to vote
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
177
click to vote
IGIS
1994
15 years 10 months ago
1994
There have been many interpolation methods developed over the years, each with their own problems. One of the biggest limitations in many applications is the non-correspondence of...
177
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
183
click to vote
FPCA
1989
15 years 10 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
152
click to vote
WDAG
1990
Springer
15 years 10 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...