Sciweavers

1007 search results - page 26 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
ISHPC
2003
Springer
15 years 7 months ago
Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
Lars Lundberg, Magnus Broberg, Kamilla Klonowska
TVCG
2012
182views Hardware» more  TVCG 2012»
13 years 4 months ago
ISP: An Optimal Out-of-Core Image-Set Processing Streaming Architecture for Parallel Heterogeneous Systems
—Image population analysis is the class of statistical methods that plays a central role in understanding the development, evolution and disease of a population. However, these t...
Linh K. Ha, Jens Krüger, João Luiz Dih...
CIKM
2001
Springer
15 years 6 months ago
Joint Optimization of Cost and Coverage of Query Plans in Data Integration
Existing approaches for optimizing queries in data integration use decoupled strategies–attempting to optimize coverage and cost in two separate phases. Since sources tend to ha...
Zaiqing Nie, Subbarao Kambhampati
ADBIS
2000
Springer
91views Database» more  ADBIS 2000»
15 years 5 months ago
Efficient Region Query Processing by Optimal Page Ordering
A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...
Daesoo Cho, Bonghee Hong
127
Voted
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 2 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...