11211 search results - page 1630 / 2243 » Rank-Sensitive Data Structures |
210
click to vote
GIS
1995
ACM
15 years 10 months ago
1995
ACM
An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving the covering blocks in the underlying spatial database. It works ...
175
click to vote
INFOCOM
1995
IEEE
15 years 10 months ago
1995
IEEE
Message-based process architectures are widely regarded as an effective method for structuring parallel protocol processing on shared memory multi-processor platforms. A message-b...
208
click to vote
ISAAC
1995
Springer
15 years 10 months ago
1995
Springer
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
192
click to vote
ISAAC
1995
Springer
15 years 10 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
213
click to vote
MPC
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...