6437 search results - page 403 / 1288 » Parallel Algorithms for Arrangements |
162
Voted
MSO
2003
15 years 6 months ago
2003
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
127
click to vote
PPAM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Replication methods can be used for shortening the data access time in Grid environment with heterogeneous storage resources. In this paper we describe the algorithms for...
157
click to vote
PAAPP
1998
15 years 4 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
123
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
166
Voted
HPDC
2005
IEEE
15 years 10 months ago
2005
IEEE
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...