11212 search results - page 712 / 2243 » Semi-persistent Data Structures |
185
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still ...
211
click to vote
DLOG
2000
15 years 8 months ago
2000
This paper investigates optimization techniques and data structures exploiting the use of so-called pseudo models. These techniques are applied to speed-up TBox and ABox reasoning...
181
click to vote
WDAS
1998
15 years 8 months ago
1998
In the counting problem, asynchronous concurrent processes repeatedly assign themselves successive values, such as integers or locations in memory. Counting networks are a class o...
146
click to vote
WSC
1997
15 years 8 months ago
1997
This paper presents a message-based discrete event simulation architecture. It will examine each of the different types of messages used to schedule events, transfer items through...
173
click to vote
UAI
1996
15 years 8 months ago
1996
The main goal of this paper is to describe a data structure called binary join trees that are useful in computing multiple marginals efficiently using the Shenoy-Shafer architectu...