1007 search results - page 141 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
148
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
120
Voted
ASIAMS
2007
IEEE
15 years 8 months ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
106
click to vote
VLDB
2004
ACM
15 years 7 months ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
106
Voted
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We consider the path-determination problem in Internet core routers that distribute flows across alternate paths leading to the same destination. We assume that the remainder ...
118
click to vote
ISDA
2009
IEEE
15 years 9 months ago
2009
IEEE
—Road Sign Detection is a major goal of Advanced Driving Assistance Systems (ADAS). Since the dawn of this discipline, much work based on different techniques has been published ...