6105 search results - page 869 / 1221 » A Parallel Algorithm for Bound-Smoothing |
201
click to vote
GIS
2006
ACM
15 years 6 months ago
2006
ACM
In this paper, we present an algorithm that performs simplification of large geographical maps through a novel use of graphics hardware. Given a map as a collection of non-interse...
183
click to vote
NECO
2008
15 years 6 months ago
2008
While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We desc...
287
click to vote
VCBM
2010
15 years 1 months ago
2010
We present a fast and interactive segmentation method for medical images that allows a smooth reconstruction of an object's surface from a set of user drawn, three-dimensiona...
196
click to vote
WDAG
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
201
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...