11212 search results - page 507 / 2243 » Semi-persistent Data Structures |
180
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We introduce a modular framework for formalizing reasoning with incomplete and inconsistent information. This framework is composed of non-deterministic semantic structur...
142
click to vote
CBMS
2007
IEEE
16 years 1 months ago
2007
IEEE
Proposing a treatment to patients is one of the physicians’ most common tasks. There are different elements that influence the decision of a physician to propose an appropriate ...
181
click to vote
CC
2005
Springer
16 years 14 days ago
2005
Springer
In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent...
166
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
193
click to vote
CDES
2008
15 years 8 months ago
2008
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...