565 search results - page 63 / 113 » Parallel Querying with Non-Dedicated Computers |
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
This work targets the emerging use of software component technology for high-performance scientific parallel and distributed computing. While component software engineering will ...
IPPS
1997
IEEE
14 years 1 days ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
MIDDLEWARE
2004
Springer
14 years 1 months ago
2004
Springer
The Internet provides a wealth of useful information in a vast number of dynamic information sources, but it is difficult to determine which sources are useful for a given query. ...
COCOON
1999
Springer
14 years 3 days ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
COCOON
1998
Springer
14 years 22 hour ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...