Sciweavers

11717 search results - page 2284 / 2344
» Where are you From
Sort
View
CC
1998
Springer
111views System Software» more  CC 1998»
13 years 9 months ago
Live Range Splitting in a Graph Coloring Register Allocator
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Keith D. Cooper, L. Taylor Simpson
CGF
1998
110views more  CGF 1998»
13 years 9 months ago
Adaptive Supersampling in Object Space Using Pyramidal Rays
We introduce a new approach to three important problems in ray tracing: antialiasing, distributed light sources, and fuzzy reflections of lights and other surfaces. For antialias...
Jon D. Genetti, Dan Gordon, G. Williams
CN
1998
64views more  CN 1998»
13 years 9 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
COMBINATORICS
1998
99views more  COMBINATORICS 1998»
13 years 9 months ago
Constructions for Cubic Graphs with Large Girth
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
Norman Biggs
COMBINATORICS
1998
100views more  COMBINATORICS 1998»
13 years 9 months ago
Lattice Paths Between Diagonal Boundaries
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
Heinrich Niederhausen
« Prev « First page 2284 / 2344 Last » Next »