Sciweavers

311 search results - page 46 / 63
» Better streaming algorithms for clustering problems
Sort
View
SIGGRAPH
2000
ACM
13 years 11 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
JPDC
2006
92views more  JPDC 2006»
13 years 7 months ago
Task assignment in heterogeneous computing systems
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We consider the version in which communicating tasks are to...
Bora Uçar, Cevdet Aykanat, Kamer Kaya, Mura...
ICDE
1999
IEEE
126views Database» more  ICDE 1999»
14 years 9 months ago
Improving the Access Time Performance of Serpentine Tape Drives
This paper presents a general model for estimating access times of serpentine tape drives. The model is used to schedule I/O requests in order to minimize the total access time. W...
Olav Sandstå, Roger Midtstraum
IJHPCA
2006
99views more  IJHPCA 2006»
13 years 7 months ago
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
Lionel Eyraud
ALGORITHMICA
1999
141views more  ALGORITHMICA 1999»
13 years 7 months ago
Design and Implementation of a Practical Parallel Delaunay Algorithm
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Mil...