15375 search results - page 103 / 3075 » cans 2008 |
SIAMDM
2000
13 years 7 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
CAGD
1999
13 years 7 months ago
1999
We investigate surfaces which interpolate given boundary curves. We show that the discrete bilinearly blended Coons patch can be defined as the solution of a linear system. With t...
CGF
1999
13 years 7 months ago
1999
This paper presents a method for modelling graphics scenes consisting of multiple volumetric objects. A twolevel hierarchical representation is employed, which enables the reducti...
SIGACT
1998
13 years 7 months ago
1998
Although mergesort is an algorithm that is frequently glossed over in textbooks, it provides fertile ground for planting ideas about algorithm analysis in the minds of students. A...
TOCS
1998
13 years 7 months ago
1998
This paper presents an experimental and analytical study of value prediction and its impact on speculative execution in superscalar microprocessors. Value prediction is a new para...