921 search results - page 100 / 185 » New Data Structures for Orthogonal Range Searching |
117
click to vote
AI
2003
Springer
15 years 9 months ago
2003
Springer
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
151
click to vote
SIGMOD
2000
ACM
15 years 8 months ago
2000
ACM
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
224
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes ...
132
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
152
click to vote
SOSP
2009
ACM
16 years 1 months ago
2009
ACM
RESIN is a new language runtime that helps prevent security vulnerabilities, by allowing programmers to specify application-level data flow assertions. RESIN provides policy obje...