3735 search results - page 395 / 747 » Order compression schemes |
161
Voted
ADBIS
2001
Springer
15 years 10 months ago
2001
Springer
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
189
Voted
ASPLOS
2006
ACM
15 years 8 months ago
2006
ACM
Different uses of memory protection schemes have different needs in terms of granularity. For example, heap security can benefit from chunk separation (by using protected "pa...
184
Voted
TIP
2008
15 years 6 months ago
2008
Image segmentation remains an important, but hard-to-solve, problem since it appears to be application dependent with usually no a priori information available regarding the image ...
213
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...
188
Voted
CIKM
2005
Springer
16 years 12 days ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...