4539 search results - page 436 / 908 » Approaches to Compute Workflow Complexity |
179
click to vote
SIGGRAPH
1999
ACM
15 years 11 months ago
1999
ACM
We present a preprocessing algorithm and run-time system for rendering 3D geometric models at a guaranteed frame rate. Our approach trades off space for frame rate by using images...
201
click to vote
ICDCS
1999
IEEE
15 years 11 months ago
1999
IEEE
Recently, push-based delivery has attracted considerable attention as a means of disseminating information to large client populations in both wired and wireless settings. In this...
182
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents the Pure/Epos approach to deal with the high complexity of adaptable operating systems and also to diminish the distance between application and operating syste...
172
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents a new algorithm called List-based Load Balancing (LLB) for compile-time task scheduling on distributed-memory machines. LLB is intended as a cluster-mapping an...
193
Voted
COMPGEOM
1998
ACM
15 years 11 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...