11212 search results - page 1929 / 2243 » Semi-persistent Data Structures |
239
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
150
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
In this paper, we present a technique for visual analysis of documents based on the semantic representation of text in the form of a directed graph, referred to as semantic graph....
155
click to vote
ICDM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—We describe a novel application of using data mining and statistical learning methods to automatically monitor and detect abnormal execution traces from console logs in ...
157
click to vote
MICRO
2009
IEEE
15 years 11 months ago
2009
IEEE
Hardware support for dynamic analysis can minimize the performance overhead of useful applications such as security checks, debugging, and profiling. To eliminate implementation ...
137
click to vote
DEXA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...