34974 search results - page 144 / 6995 » The particle computer system |
132
click to vote
SAC
2011
ACM
14 years 3 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
93
Voted
SIGGRAPH
2000
ACM
15 years 5 months ago
2000
ACM
In this paper, we present a new model of snow accumulation and stability for computergraphics. Our contribution is divided into two major components, each essential for modelling ...
136
Voted
COCOON
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
80
Voted
ICRA
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract—Automation has long been recognized as an important goal in AFM (Atomic Force Microscope) nanomanipulation research. For the precise manipulation of small particles with...
122
Voted
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
Virtually all methods in image processing and computer vision, for removing weather effects from images, assume single scattering of light by particles in the atmosphere. In reali...