Sciweavers

8582 search results - page 1461 / 1717
» Here or There
Sort
View
ICALP
1993
Springer
15 years 10 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
COMPGEOM
1992
ACM
15 years 10 months ago
On-Line Steiner Trees in the Euclidean Plane
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...
Noga Alon, Yossi Azar
PEPM
1994
ACM
15 years 10 months ago
Improving CPS-Based Partial Evaluation: Writing Cogen by Hand
It is well-known that self-applicable partial evaluation can be used to generate compiler generators: cogen = mix(mix;mix), where mix is the specializer (partial evaluator). Howev...
Anders Bondorf, Dirk Dussart
SIGGRAPH
1993
ACM
15 years 10 months ago
Hierarchical Z-buffer visibility
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...
Ned Greene, Michael Kass, Gavin S. P. Miller
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
15 years 10 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
« Prev « First page 1461 / 1717 Last » Next »