562 search results - page 73 / 113 » Ordered Sets in the Calculus of Data Structures |
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
111
click to vote
AUSDM
2008
Springer
14 years 11 months ago
2008
Springer
Malware detection is an important problem today. New malware appears every day and in order to be able to detect it, it is important to recognize families of existing malware. Dat...
177
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
VLDB
1994
ACM
15 years 1 months ago
1994
ACM
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
MICAI
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we discuss tree kernels that can be applied for the classification of XML documents based on their DOM trees. DOM trees are ordered trees, in which every node might...