1007 search results - page 3 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
ISCI
2007
13 years 5 months ago
2007
Declustering techniques reduce query response time through parallel I/O by distributing data among multiple devices. Except for a few cases it is not possible to find declusterin...
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
Spatial queries for extracting data from wireless sensor networks are important for many applications, such as environmental monitoring and military surveillance. One such query i...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
PPL
2000
13 years 5 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
OSN
2011
12 years 8 months ago
2011
—This paper presents PI-OPS (Parallel-Iterative Optical Packet Scheduler) a parallel-iterative scheduler for asynchronous Optical Packet Switching nodes with optical buffering. O...