2254 search results - page 349 / 451 » Computing the minimal covering set |
174
click to vote
NPC
2004
Springer
15 years 11 months ago
2004
Springer
Massively parallel computing systems are being built with thousands of nodes. Because of the high number of components, it is critical to keep these systems running even in the pre...
182
click to vote
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper brings a novel method for three-dimensional reconstruction of surfaces that takes advantage of the symmetry resulting from alternating the positions of a camera and a l...
196
click to vote
VISUALIZATION
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents a novel algorithm combining view-dependent rendering and conservative occlusion culling for interactive display of complex environments. A vertex hierarchy of ...
161
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
151
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, a fault-tolerant routing in 2-D meshes with dynamic faults is provided. It is based on an early work on minimal routing in 2-D meshes with static faults. Unlike man...