Sciweavers

6437 search results - page 5 / 1288
» Parallel Algorithms for Arrangements
Sort
View
MTPP
2010
13 years 2 months ago
Parallelization of Motion JPEG Decoder on TILE64 Many-Core Platform
The ubiquity of many-core architectures poses challenges to software developers to make scalable software. To parallelize data-intensive applications on a many-core platform, one h...
Xuan-Yi Lin, Chung-Yu Huang, Pei-Man Yang, Tai-Wen...
CCGRID
2006
IEEE
14 years 1 months ago
Nexus: A Novel Weighted-Graph-Based Prefetching Algorithm for Metadata Servers in Petabyte-Scale Storage Systems
Abstract— An efficient, accurate and distributed metadataoriented prefetching scheme is critical to the overall performance in large distributed storage systems. In this paper, ...
Peng Gu, Yifeng Zhu, Hong Jiang, Jun Wang
COMPGEOM
2003
ACM
14 years 29 days ago
Shape fitting with outliers
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
Sariel Har-Peled, Yusu Wang
STOC
2006
ACM
57views Algorithms» more  STOC 2006»
14 years 8 months ago
Integrality gaps for sparsest cut and minimum linear arrangement problems
Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nish...
FOCS
1999
IEEE
14 years 5 hour ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled