Sciweavers

5165 search results - page 123 / 1033
» Consistency of the Neighbor-Net Algorithm
Sort
View
128
Voted
WEA
2007
Springer
87views Algorithms» more  WEA 2007»
15 years 11 months ago
Algorithms for Longer OLED Lifetime
Abstract. We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize the amplitude of the electrical current flowing ...
Friedrich Eisenbrand, Andreas Karrenbauer, Chihao ...
HPCC
2005
Springer
15 years 10 months ago
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
Doruk Bozdag, Ümit V. Çatalyürek,...
OOPSLA
2005
Springer
15 years 10 months ago
Lifting sequential graph algorithms for distributed-memory parallel computation
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
Douglas Gregor, Andrew Lumsdaine
164
Voted
IPPS
2003
IEEE
15 years 10 months ago
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
Yang Yang, Henri Casanova
128
Voted
SIGGRAPH
1993
ACM
15 years 9 months ago
Smooth transitions between bump rendering algorithms
A method is describedfor switching smoothly between rendering algorithms as required by the amount of visible surface detail. The result will be more realism with less computation...
Barry G. Becker, Nelson L. Max