17840 search results - page 3545 / 3568 » Heterogeneous Parallel Computing |
197
click to vote
COCOON
1998
Springer
15 years 10 months 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...
155
click to vote
VISUALIZATION
1996
IEEE
15 years 10 months ago
1996
IEEE
A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Re...
152
click to vote
ICALP
1992
Springer
15 years 10 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
165
click to vote
SIGIR
1992
ACM
15 years 10 months ago
1992
ACM
ct tasks such as extraction of relational information from text [Young] [Jacobs]. We describe a method for classifying news stories using Alternative systems [Biebricher] [Lewis] u...
212
click to vote
POPL
1989
ACM
15 years 10 months ago
1989
ACM
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...