6437 search results - page 14 / 1288 » Parallel Algorithms for Arrangements |
92
Voted
JSSPP
2005
Springer
15 years 6 months ago
2005
Springer
As grid computing becomes more commonplace, so does the importance of coscheduling these geographically distributed resourcest. Negotiating resource management and scheduling deci...
93
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
108
Voted
DCG
2008
15 years 15 days ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
97
Voted
COMGEO
2007
ACM
15 years 12 days ago
2007
ACM
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...
CORR
2007
Springer
15 years 12 days ago
2007
Springer
: This paper describes a new parallel kinematic architecture for machining applications: the orthoglide. This machine features three fixed parallel linear joints which are mounted ...