11212 search results - page 493 / 2243 » Semi-persistent Data Structures |
163
click to vote
TAPSOFT
1993
Springer
15 years 11 months ago
1993
Springer
: We propose a new algebraic framework for exception handling which is powerful enough to cope with many exception handling features such that recovery, implicit propagation of exc...
207
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
196
click to vote
VLDB
1995
ACM
15 years 10 months ago
1995
ACM
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
200
click to vote
NIPS
1990
15 years 8 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
172
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...