Sciweavers

43 search results - page 5 / 9
» Efficient Disk Replacement and Data Migration Algorithms for...
Sort
View
WAE
2000
128views Algorithms» more  WAE 2000»
13 years 9 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs
DASFAA
2004
IEEE
102views Database» more  DASFAA 2004»
13 years 11 months ago
Efficient Declustering of Non-uniform Multidimensional Data Using Shifted Hilbert Curves
Abstract. Data declustering speeds up large data set retrieval by partitioning the data across multiple disks or sites and performing retrievals in parallel. Performance is determi...
Hak-Cheol Kim, Mario A. Lopez, Scott T. Leutenegge...
CORR
2010
Springer
320views Education» more  CORR 2010»
13 years 7 months ago
An algorithm for the principal component analysis of large data sets
Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy -- even on parallel processors -- unlike the...
Nathan Halko, Per-Gunnar Martinsson, Yoel Shkolnis...
COMSWARE
2008
IEEE
14 years 2 months ago
An efficient and bandwidth sensitive parallel download scheme in data grids
—For modern scientific applications such as astrophysics, astronomy, aerography, and biology, a large amount of storage space is required because of the large-scale datasets. Dat...
Ruay-Shiung Chang, Chun-Fu Lin, Jiing-Hsing Ruey, ...
BMCBI
2010
189views more  BMCBI 2010»
13 years 7 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...