Sciweavers

11211 search results - page 2032 / 2243
» Rank-Sensitive Data Structures
Sort
View
LICS
1997
IEEE
15 years 6 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
155
Voted
RTA
1995
Springer
15 years 6 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi
SC
1995
ACM
15 years 6 months ago
Detecting Coarse - Grain Parallelism Using an Interprocedural Parallelizing Compiler
This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates...
Mary W. Hall, Saman P. Amarasinghe, Brian R. Murph...
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
15 years 6 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
VISUALIZATION
1995
IEEE
15 years 6 months ago
Enhancing Transparent Skin Surfaces with Ridge and Valley Lines
There are many applications that can benefit from the simultaneous display of multiple layers of data. The objective in these cases is to render the layered surfaces in a such way...
Victoria Interrante, Henry Fuchs, Stephen M. Pizer
« Prev « First page 2032 / 2243 Last » Next »